The Power of Greedy for Online Minimum Cost Matching on the Line
Abstract
References
Index Terms
- The Power of Greedy for Online Minimum Cost Matching on the Line
Recommendations
Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays
Computing and CombinatoricsAbstractIn this paper, we study the Min-cost Perfect k-way Matching with Delays (k-MPMD), recently introduced by Melnyk et al. In the problem, m requests arrive one-by-one over time in a metric space. At any time, we can irrevocably make a group of k ...
Online Facility Assignment for General Layout of Servers on a Line
Combinatorial Optimization and ApplicationsThe Power of Rejection in Online Bottleneck Matching
Combinatorial Optimization and ApplicationsAbstractWe consider the online matching problem, where server-vertices lie in a metric space and request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. We focus on the egalitarian bottleneck objective, ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/9a22127e-eb2f-4989-89d9-e5ce9bdce6b1/3580507.cover.jpg)
- Chair:
- Kevin Leyton-Brown,
- Program Chair:
- Jason D Hartline,
- Program Co-chair:
- Larry Samuelson
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 126Total Downloads
- Downloads (Last 12 months)94
- Downloads (Last 6 weeks)15
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in