The following pages link to (Q4250161):
Displaying 25 items.
- Geometric spanners with applications in wireless networks (Q868107) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
