Approximation Algorithms for Covering Vertices by Long Paths.
Mingyang GongJing FanGuohui LinEiji MiyanoPublished in: MFCS (2022)
Keyphrases
- approximation algorithms
- undirected graph
- disjoint paths
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- primal dual
- facility location problem
- set cover
- network design problem
- approximation schemes
- open shop
- approximation ratio
- constant factor
- randomized algorithms
- exact algorithms
- np hardness
- polynomial time approximation
- integrality gap
- optimal solution
- precedence constraints
- network flow
- finite number
- shortest path
- linear programming
- scheduling problem