Approximation schemes for NP-hard geometric optimization problems: a survey
From MaRDI portal
Recommendations
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Approximation schemes for node-weighted geometric Steiner tree problems
- scientific article; zbMATH DE number 1163704
- scientific article; zbMATH DE number 1555959
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Cited in
(34)- Degree-bounded minimum spanning trees
- Steiner intervals, geodesic intervals, and betweenness
- Location, pricing and the problem of Apollonius
- Approximating the generalized minimum Manhattan network problem
- Some easy and some not so easy geometric optimization problems
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model
- A convex approach to the Gilbert-Steiner problem
- Approximation schemes for node-weighted geometric Steiner tree problems
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Approximating minimum Steiner point trees in Minkowski planes
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- scientific article; zbMATH DE number 2081090 (Why is no real title available?)
- Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- Dynamic programming approach to the generalized minimum Manhattan network problem
- Literature reviews in operations research: a new taxonomy and a meta review
- A Modern View on Stability of Approximation
- Optimal transport methods for combinatorial optimization over two random point sets
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
- PTAS for Euclidean travelling salesman problem with soft time windows
- A gap-ETH-tight approximation scheme for Euclidean TSP
- A PTAS for k-hop MST on the Euclidean plane: improving dependency on k
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- On the minimum corridor connection problem and other generalized geometric problems
- Subsets of rectifiable curves in Hilbert space-the analyst's TSP
- On single courier problem
This page was built for publication: Approximation schemes for NP-hard geometric optimization problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403283)
