Travelling on Graphs with Small Highway Dimension

Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen

doi:10.1007/s00453-020-00785-5

Cited by 3 publications

(3 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These structural properties were also leveraged by Becker et al [6] who gave a PTAS for the Bounded-Capacity Vehicle Routing problem, and a parameterized approximation scheme for the k-Center problem (which is essentially k-Clustering q with q = ∞) and k-Median. In the lower bound side, Disser et al [12] showed that Steiner Tree and TSP are weakly NP-hard even when the highway dimension is 1, i.e., each of them is NP-hard but an FPTAS exists for graphs of highway dimension 1.…”

Section: Our Resultsmentioning

confidence: 99%

Polynomial time approximation schemes for clustering in low highway dimension graphs

Feldmann

Saulpic²

2021

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highway dimension, which is a graph parameter modeling transportation networks. It was previously shown that approximation schemes for these problems exist, which either run in quasi-polynomial time (assuming constant highway dimension) [Feldmann et al. SICOMP 2018] or run in FPT time (parameterized by the number of clusters k, the highway dimension, and the approximation factor) [Becker et al. ESA 2018, Braverman et al. 2020. In this paper we show that a polynomial-time approximation scheme (PTAS) exists (assuming constant highway dimension). We also show that the considered problems are NP-hard on graphs of highway dimension 1.

show abstract

Section: Our Resultsmentioning

confidence: 99%

Polynomial time approximation schemes for clustering in low highway dimension graphs

Feldmann

Saulpic²

2021

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…These structural properties were also leveraged by Becker et al [8] who gave a PTAS for the Bounded-Capacity Vehicle Routing problem, and a parameterized approximation scheme for the k-Center problem (which is essentially k-Clustering q with q = ∞) and k-Median. In the lower bound side, Disser et al [15] showed that Steiner Tree and TSP are weakly NP-hard even when the highway dimension is 1, i.e., each of them is NP-hard but an FPTAS exists.…”

Section: Related Workmentioning

confidence: 99%

Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs

Feldmann,

Saulpic

2020

Preprint

Self Cite

View full text Add to dashboard Cite

We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highway dimension, which is a graph parameter modeling transportation networks. It was previously shown that approximation schemes for these problems exist, which either run in quasipolynomial time (assuming constant highway dimension) [Feldmann et al. SICOMP 2018] or run in FPT time (parameterized by the number of clusters k, the highway dimension, and the approximation factor) [Becker et al. ESA 2018, Braverman et al. 2020. In this paper we show that a polynomial-time approximation scheme (PTAS) exists (assuming constant highway dimension). We also show that the considered problems are NP-hard on graphs of highway dimension 1.

show abstract

“…For Bounded-Capacity Vehicle Routing a PTAS was shown [10], and the same work also gives approximation schemes for the k-Median and k-Center problems, when parameterizing by k and the highway dimension. The k-Center problem is hard even in the parameterized setting [23,24], and Traveling Salesperson was recently shown [20] to be weakly NP-hard even if the highway dimension is 1. It is an intriguing question whether the problems studied in this paper also admit PTASs for low highway dimension graphs.…”

Section: On Highway Dimensionmentioning

confidence: 99%

Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics

Saulpic

Cohen-Addad

Feldmann

2019

2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)

Self Cite

View full text Add to dashboard Cite

We consider the classic Facility Location, k-Median, and k-Means problems in metric spaces of doubling dimension d. We give nearly linear-time approximation schemes for each problem. The complexity of our algorithms is 2 plogp1{εq{εq Opd 2 q n log 4 n`2 Opdq n log 9 n, making a significant improvement over the state-of-the-art algorithms which run in time n pd{εq Opdq .Moreover, we show how to extend the techniques used to get the first efficient approximation schemes for the problems of prize-collecting k-Medians and k-Means, and efficient bicriteria approximation schemes for k-Medians with outliers, k-Means with outliers and k-Center.help to handle some noise from the input: the k-Median objective can be dramatically perturbed by the addition of a few distant clients, which must then be discarded. Our resultsWe solve this open problem by proposing the first near-linear time algorithms for the k-Median and k-Means problems in metrics of fixed doubling dimension. More precisely, we show the following theorems, where we let f pεq " p1{εq 1{ε .Theorem 1.1. For any 0 ă ε ă 1{3, there exists a randomized p1`εq-approximation algorithm for k-Median in metrics of doubling dimension d with running time f pεq 2 Opd 2 q n log 4 n`2 Opdq n log 9 n and success probability at least 1´ε.Theorem 1.2. For any 0 ă ε ă 1{3, there exists a randomized p1`εq-approximation algorithm for k-Means in metrics of doubling dimension d with running time f pεq 2 Opd 2 q n log 5 n`2 Opdq n log 9 n and success probability at least 1´ε.Our results also extend to the Facility Location problem, in which no bound on the number of opened centers is given, but each center comes with an opening cost. The aim is to minimize the sum of the (1st power) of the distances from each point of the metric to its closest center, in addition to the total opening costs of all used centers.Theorem 1.3. For any 0 ă ε ă 1{3, there exists a randomized p1`εq-approximation algorithm for Facility Location in metrics of doubling dimension d with running time f pεq 2 Opd 2 q¨n`2 Opdq n log n and success probability at least 1´ε.In all these theorems, we make the common assumption to have access to the distances of the metric in constant time, as, e.g., in [18,27,29]. This assumption is discussed in Bartal et al. [9].Note that the double-exponential dependence on d is unavoidable unless P = NP, since the problems are APX-hard in Euclidean space of dimension d " Oplog nq. For Euclidean inputs, our algorithms for the k-Means and k-Median problems outperform the ones of Cohen-Addad [15], removing in particular the dependence on k, and the one of Kolliopoulos and Rao [32] when d ą 3, by removing the dependence on log d`6 n. Interestingly, for k " ωplog 9 nq our algorithm for the k-Means problem is faster than popular heuristics like k-Means++ which runs in time Opnkq in Euclidean space. We note that the success probability can be boosted to 1´ε δ by repeating the algorithm log δ times and outputting the best solution encountered.After proving the three theorems above, we will a...

show abstract

Travelling on Graphs with Small Highway Dimension

Abstract: This is a repository copy of Travelling on graphs with small highway dimension.

Cited by 3 publications

References 57 publications

Polynomial time approximation schemes for clustering in low highway dimension graphs

Polynomial time approximation schemes for clustering in low highway dimension graphs

Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs

Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics

Contact Info

Product

Resources

About