Amanote Research
Register
Sign In
A PTAS for Subset TSP in Minor-Free Graphs
doi 10.1137/1.9781611975994.140
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2020
Authors
Hung Le
Publisher
Society for Industrial and Applied Mathematics
Related search
PTAS for Densest K-Subgraph in Interval Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Reducing Curse of Dimensionality: Improved PTAS for TSP (With Neighborhoods) in Doubling Metrics
Linear Kernels for (Connected) Dominating Set onH-minor-free Graphs
Diameter Computation on H-Minor Free Graphs and Graphs of Bounded (Distance) VC-dimension
Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs
Approximation Schemes via Width/Weight Trade-Offs on Minor-Free Graphs
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
Fast Minor Testing in Planar Graphs
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Mild Cognitive Impairment: A Subset of Minor Neurocognitive Disorder?
American Journal of Geriatric Psychiatry
Psychiatry
Gerontology
Geriatrics
Mental Health
