A 16-competitive algorithm for hierarchical median problem

DOI10.1007/s11432-014-5065-0zbMath1327.90089OpenAlexW1979859736MaRDI QIDQ893690

Wenqiang Dai

Publication date: 20 November 2015

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-014-5065-0

zbMATH Keywords

algorithmcompetitive ratiomedianlocationhierarchical

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental facility location problem and its competitive algorithms
• Better bounds for incremental medians
• Foundations of location analysis
• The \(p\)-median problem: a survey of metaheuristic approaches
• Combinatorial optimisation and hierarchical classifications
• Incremental medians via online bidding
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• The Online Median Problem
• A General Approach for Incremental Approximation and Hierarchical Clustering
• Approximation algorithms for hierarchical location problems

This page was built for publication: A 16-competitive algorithm for hierarchical median problem