scientific article; zbMATH DE number 1303538
From MaRDI portal
Publication:4250161
Recommendations
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- A subset spanner for Planar graphs, with application to subset TSP
- Engineering an approximation scheme for traveling salesman in planar graphs
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
Cited in
(39)- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Constant factor approximation for ATSP with two edge weights
- A priori TSP in the scenario model
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Approximation algorithms via contraction decomposition
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- The Chinese deliveryman problem
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
- Good triangulations yield good tours
- Better approximability results for min-max tree/cycle/path cover problems
- The traveling salesman problem on cubic and subcubic graphs
- An improved upper bound for the TSP in cubic 3-edge-connected graphs
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- An LP-based approximation algorithm for the generalized traveling salesman path problem
- scientific article; zbMATH DE number 1670877 (Why is no real title available?)
- A priori TSP in the Scenario Model
- TSP on cubic and subcubic graphs
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Engineering an approximation scheme for traveling salesman in planar graphs
- scientific article; zbMATH DE number 2119747 (Why is no real title available?)
- A PTAS for three-edge-connected survivable network design in planar graphs
- scientific article; zbMATH DE number 7529154 (Why is no real title available?)
- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- A subexponential parameterized algorithm for subset TSP on planar graphs
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- Travelling on graphs with small highway dimension
- A quasi-polynomial algorithm for well-spaced hyperbolic TSP
- A gap-ETH-tight approximation scheme for Euclidean TSP
- Exploration of graphs with excluded minors
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- O(1) Steiner point removal in series-parallel graphs
- TSP in a simple polygon
- A PTAS for k-hop MST on the Euclidean plane: improving dependency on k
- Approximation schemes for planar graph connectivity problems
- Geometric spanners with applications in wireless networks
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
- Dynamic programming and planarity: improved tree-decomposition based algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250161)
