Constrained \(k\)-center and movement to independence

DOI10.1016/J.DAM.2011.01.008zbMath1214.68173OpenAlexW1977188158MaRDI QIDQ534356

Adrian Dumitrescu, Ming-Hui Jiang

Publication date: 17 May 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.008

zbMATH Keywords

linear programmingapproximation algorithmindependent setcomputational geometryclient-server problemfixed parameter tractable algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ Fast solution of single-machine scheduling problem with embedded jobs ⋮ Dispersion in disks ⋮ Constrained k-Center Problem on a Convex Polygon

Cites Work

• Unnamed Item
• Systems of distant representatives
• Minimizing movement
• Dispersion in unit disks
• Minimizing movement in mobile facility location problems
• Approximation algorithms for spreading points
• Universality considerations in VLSI circuits
• Planar Formulae and Their Uses

This page was built for publication: Constrained \(k\)-center and movement to independence