scientific article; zbMATH DE number 1303538
From MaRDI portal
Publication:4250161
zbMath0930.68104MaRDI QIDQ4250161
Andrzej Woloszyn, Michelangelo Grigni, David R. Karger, Philip N. Klein
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Good triangulations yield good tours ⋮ Constant Factor Approximation for ATSP with Two Edge Weights ⋮ Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane ⋮ Geometric spanners with applications in wireless networks ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ An LP-based approximation algorithm for the generalized traveling salesman path problem ⋮ How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms ⋮ Approximation algorithms via contraction decomposition ⋮ A priori TSP in the Scenario Model ⋮ Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions ⋮ The traveling salesman problem on cubic and subcubic graphs ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs ⋮ TSP on Cubic and Subcubic Graphs ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ An improved upper bound for the TSP in cubic 3-edge-connected graphs ⋮ Dynamic programming and planarity: improved tree-decomposition based algorithms ⋮ Exact algorithms for the Hamiltonian cycle problem in planar graphs ⋮ The Chinese deliveryman problem ⋮ Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs ⋮ Constant factor approximation for ATSP with two edge weights ⋮ A priori TSP in the scenario model ⋮ Travelling on graphs with small highway dimension ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems ⋮ Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
This page was built for publication:
