Pages that link to "Item:Q3549328"
From MaRDI portal
The following pages link to A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights (Q3549328):
Displayed 18 items.
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Routing vehicles to minimize fuel consumption (Q2450732) (← links)
- (Q3191144) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- (Q5743390) (← links)
- (Q5743427) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)