Mostra el registre d'ítem simple
Online matching in regular bipartite graphs
dc.contributor.author | Barrière Figueroa, Eulalia |
dc.contributor.author | Fuchs, Janosch |
dc.contributor.author | Muñoz Lopez, Xavier |
dc.contributor.author | Unger, Walter |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-10-02T09:00:20Z |
dc.date.available | 2019-06-01T02:31:11Z |
dc.date.issued | 2018-06-01 |
dc.identifier.citation | Barriere, 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.issn | 0129-6264 |
dc.identifier.uri | http://hdl.handle.net/2117/121729 |
dc.description.abstract | In 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.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Graph theory |
dc.title | Online matching in regular bipartite graphs |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1142/S0129626418500081 |
dc.relation.publisherversion | https://www.worldscientific.com/doi/abs/10.1142/S0129626418500081 |
dc.rights.access | Open Access |
local.identifier.drac | 23245243 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Barriere, E.; Fuchs, J.; Muñoz, X.; Unger, W. |
local.citation.publicationName | Parallel processing letters |
local.citation.volume | 28 |
local.citation.number | 2 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.269]
-
Articles de revista [290]