Show simple item record

dc.contributor.authorBarrière Figueroa, Eulalia
dc.contributor.authorFuchs, Janosch
dc.contributor.authorMuñoz Lopez, Xavier
dc.contributor.authorUnger, Walter
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2018-10-02T09:00:20Z
dc.date.issued2018-06-01
dc.identifier.citationBarriere, E., Fuchs, J., Muñoz, X., Unger, W. Online matching in regular bipartite graphs. "Parallel processing letters", 1 Juny 2018, vol. 28, núm. 2.
dc.identifier.issn0129-6264
dc.identifier.urihttp://hdl.handle.net/2117/121729
dc.description.abstractIn an online problem, the input is revealed one piece at a time. In every time step, the online algorithm has to produce a part of the output, based on the partial knowledge of the input. Such decisions are irrevocable, and thus online algorithms usually lead to nonoptimal solutions. The impact of the partial knowledge depends strongly on the problem. If the algorithm is allowed to read binary information about the future, the amount of bits read that allow the algorithm to solve the problem optimally is the socalled advice complexity. The quality of an online algorithm is measured by its competitive ratio, which compares its performance to that of an optimal offline algorithm. In this paper we study online bipartite matchings focusing on the particular case of bipartite matchings in regular graphs. We give tight upper and lower bounds on the competitive ratio of the online deterministic bipartite matching problem. The competitive ratio turns out to be asymptotically equal to the known randomized competitive ratio. Afterwards, we present an upper and lower bound for the advice complexity of the online deterministic bipartite matching problem.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshGraph theory
dc.titleOnline matching in regular bipartite graphs
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.1142/S0129626418500081
dc.relation.publisherversionhttps://www.worldscientific.com/doi/abs/10.1142/S0129626418500081
dc.rights.accessRestricted access - publisher's policy
drac.iddocument23245243
dc.description.versionPostprint (author's final draft)
dc.date.lift2019-06
upcommons.citation.authorBarriere, E., Fuchs, J., Muñoz, X., Unger, W.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameParallel processing letters
upcommons.citation.volume28
upcommons.citation.number2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder