A 16-competitive algorithm for hierarchical median problem

DOI10.1007/S11432-014-5065-0zbMATH Open1327.90089OpenAlexW1979859736MaRDI QIDQ893690FDOQ893690

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

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

zbMATH Keywords

medianalgorithmlocationcompetitive ratiohierarchical

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The \(p\)-median problem: a survey of metaheuristic approaches
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• The Online Median Problem
• A general approach for incremental approximation and hierarchical clustering
• Incremental medians via online bidding
• Title not available (Why is that?)
• Foundations of location analysis
• Combinatorial optimisation and hierarchical classifications
• Incremental facility location problem and its competitive algorithms
• Better bounds for incremental medians
• Approximation algorithms for hierarchical location problems

Cited In (1)

• An approximation algorithm for the hierarchical median problem

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)