English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line

MPS-Authors
/persons/resource/persons79185

Antoniadis,  Antonios
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., & Scquizzato, M. (2015). A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. In Approximation and Online Algorithms (pp. 11-22). Berlin: Springer. doi:10.1007/978-3-319-18263-6_2.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-43DB-5
Abstract
There is no abstract available