A QPTAS for facility location on unit disk graphs
From MaRDI portal
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A polynomial-time approximation scheme for facility location on planar graphs
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- A weakly robust PTAS for minimum clique partition in unit disk graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Compact and low delay routing labeling scheme for unit disk graphs
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Excluded minors, network decomposition, and multicommodity flow
- Graph-Theoretic Concepts in Computer Science
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 1507300 (Why is no real title available?)
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
- Routing in unit disk graphs
- Separators in region intersection graphs
- Shortest path separators in unit disk graphs
- Shortest paths in intersection graphs of unit disks
- Well-separated pair decomposition for the unit-disk graph metric and its applications
This page was built for publication: A QPTAS for facility location on unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312576)
