An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem

DOI10.1007/978-3-642-21204-8_7zbMath1329.90079OpenAlexW2105734639MaRDI QIDQ3004653

Wenqiang Dai, Yi Feng

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_7

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved complexity bounds for location problems on the real line
• Oblivious Medians Via Online Bidding
• A new greedy approach for facility location problems
• A general approach for incremental approximation and hierarchical clustering
• An Overview of Representative Problems in Location Research
• Greedy Strikes Back: Improved Facility Location Algorithms
• The Online Median Problem
• Local search heuristic for k-median and facility location problems
• Better Bounds for Incremental Medians

This page was built for publication: An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem