Generalized \(k\)-center: distinguishing doubling and highway dimension
From MaRDI portal
Publication:6043186
DOI10.1007/978-3-031-15914-5_16arXiv2209.00675MaRDI QIDQ6043186
Andreas Emil Feldmann, Tung Anh Vu
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.00675
doubling dimensionhighway dimensionparameterized approximationcapacitated \(k\)-supplier with outliers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Centrality of trees for capacitated \(k\)-center
- A survey of healthcare facility location
- The parameterized hardness of the \(k\)-center problem in transportation networks
- Polynomial time approximation schemes for clustering in low highway dimension graphs
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Constant Factor Approximation for Capacitated k-Center with Outliers
- The Design of Approximation Algorithms
- Highway Dimension and Provably Efficient Shortest Path Algorithms
- Capacitated Domination and Covering: A Parameterized Perspective
- Bypassing the embedding
- Planar Capacitated Dominating Set Is W[1-Hard]
- A Best Possible Heuristic for the k-Center Problem
- A Lottery Model for Center-Type Problems With Outliers
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Parameterized Algorithms
- Hierarchy of Transportation Network Parameters and Hardness Results
This page was built for publication: Generalized \(k\)-center: distinguishing doubling and highway dimension
