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
(30)- Degree-bounded minimum spanning trees
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- A Modern View on Stability of Approximation
- Approximating the generalized minimum Manhattan network problem
- Steiner intervals, geodesic intervals, and betweenness
- Some easy and some not so easy geometric optimization problems
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- Location, pricing and the problem of Apollonius
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- On the minimum corridor connection problem and other generalized geometric problems
- Literature reviews in operations research: a new taxonomy and a meta review
- A convex approach to the Gilbert-Steiner problem
- Optimal transport methods for combinatorial optimization over two random point sets
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
- Dynamic programming approach to the generalized minimum Manhattan network problem
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation schemes for node-weighted geometric Steiner tree problems
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- On single courier problem
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model
- Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
- Approximating minimum Steiner point trees in Minkowski planes
- Subsets of rectifiable curves in Hilbert space-the analyst's TSP
- scientific article; zbMATH DE number 2081090 (Why is no real title available?)
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)
