Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On-line matching in regular bipartite graphs

Autor
Barriere, E.; Muñoz, X.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
22nd International Colloquium on Structural Information and Communication Complexity
Any de l'edició
2015
Data de presentació
2015-07-16
Resum
In an online problem, the input is revealed one step at a time. At every step, the online algorithm has to produce part of the output, based on the partial knowledge of the input. Such decisions are irrevocable, and thus online algorithms usually lead to a non optimal solution. The quality of an online algorithm is measured by its competitive ratio, which compares its performance with that of an optimal offline algorithm. The online bipartite matching problem has been studied since a first paper...
Paraules clau
On-line Algorithm, Matching, Bipartite Graph, Regular Graph
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions

Participants