Pages that link to "Item:Q2931435"

The following pages link to A subset spanner for Planar graphs, with application to subset TSP (Q2931435):

Displaying 11 items.

• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
• Approximation algorithms via contraction decomposition (Q1945289) (← links)
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
• Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
• A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
• (Q5743427) (← links)
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
• Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
• Multi-priority graph sparsification (Q6182885) (← links)