A 16-competitive algorithm for hierarchical median problem

DOI10.1007/S11432-014-5065-0MaRDI QIDQ893690zbMATH OpenOpenAlexFDO

Authors 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

medianalgorithmlocationcompetitive ratiohierarchical

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• An approximation algorithm for the hierarchical median problem
• An improved competitive algorithm for one-dimensional incremental median problem
• Better bounds for incremental medians
• Better Bounds for Incremental Medians
• An approximation algorithm for the Euclidean incremental median problem

Cites work

• scientific article; zbMATH DE number 1670526 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• A general approach for incremental approximation and hierarchical clustering
• Approximation algorithms for hierarchical location problems
• Better bounds for incremental medians
• Combinatorial optimisation and hierarchical classifications
• Foundations of location analysis
• Incremental facility location problem and its competitive algorithms
• Incremental medians via online bidding
• The Online Median Problem
• The \(p\)-median problem: a survey of metaheuristic approaches

Cited in

(1)

• An approximation algorithm for the hierarchical median problem

Describes a project that uses

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893690)