Approximation schemes for NP-hard geometric optimization problems: a survey

From MaRDI portal
Publication:1403283

DOI10.1007/s10107-003-0438-yzbMath1035.90113OpenAlexW1520111182MaRDI QIDQ1403283

No author found.

Publication date: 1 September 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0438-y




Related Items (26)

On the minimum corridor connection problem and other generalized geometric problemsA $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth GraphsApproximation schemes for node-weighted geometric Steiner tree problemsApproximation schemes for Euclidean vehicle routing problems with time windowsVariational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar CaseA Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTWLocation, pricing and the problem of ApolloniusLiterature reviews in operations research: a new taxonomy and a meta reviewA convex approach to the Gilbert-Steiner problemA Modern View on Stability of ApproximationOptimal transport methods for combinatorial optimization over two random point setsA $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth GraphsSubsets of rectifiable curves in Hilbert space-the analyst's TSPPolynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphsOn single courier problemA quasipolynomial time approximation scheme for Euclidean capacitated vehicle routingApproximating the generalized minimum Manhattan network problemApproximating minimum Manhattan networks in higher dimensionsApproximating minimum Steiner point trees in Minkowski planesDynamic programming approach to the generalized minimum Manhattan network problemOn the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost FlowsContinuous reformulations and heuristics for the Euclidean travelling salesperson problemDegree-bounded minimum spanning treesSteiner intervals, geodesic intervals, and betweennessHeuristic optimization for multi-depot vehicle routing problem in ATM network modelPolynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems


Uses Software





This page was built for publication: Approximation schemes for NP-hard geometric optimization problems: a survey