The Priority k-Median Problem

DOI10.1007/978-3-540-77050-3_6zbMath1135.90364OpenAlexW1598814556MaRDI QIDQ5458823

Amit Kumar, Yogish Sabharwal

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_6

Mathematics Subject Classification ID

Continuous location (90B85) Approximation algorithms (68W25)

Related Items (2)

A unified framework of FPT approximation algorithms for clustering problems ⋮ The Priority k-Median Problem

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Local search heuristic for k-median and facility location problems
• Improved Combinatorial Algorithms for Facility Location Problems
• The Priority k-Median Problem
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Priority k-Median Problem