Budgeted red-blue median and its generalizations

DOI10.1007/978-3-642-15775-2_27MaRDI QIDQ3586473zbMATH OpenOpenAlexFDO

Authors Rohit Khandekar, Mohammad T. Hajiaghayi, Guy Kortsarz

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15775-2_27

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Local search algorithms for the red-blue median problem
• Tight analysis of a multiple-swap heuristic for budgeted red-blue median
• An improved approximation algorithm for the prize-collecting red-blue median problem
• Improved approximation for prize-collecting red-blue median
• Budget constrained minimum cost connected medians

Cited in

(12)

• Facility location with red-blue demands
• Improved approximation for prize-collecting red-blue median
• Budget constrained minimum cost connected medians
• Tight analysis of a multiple-swap heuristic for budgeted red-blue median
• A constant approximation for colorful k-center
• Covering clients with types and budgets
• Constant factor approximation algorithm for the knapsack median problem
• Small Space Stream Summary for Matroid Center
• Approximation algorithms for diversity-bounded center problems
• Towards a theoretical understanding of why local search works for clustering with fair-center representation
• Local search algorithms for the red-blue median problem
• Parameterized approximation schemes for fair-range clustering

This page was built for publication: Budgeted red-blue median and its generalizations

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