Approximation algorithms for covering vertices by long paths.
Mingyang GongBrett EdgarJing FanGuohui LinEiji MiyanoPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- disjoint paths
- undirected graph
- np hard
- special case
- vertex cover
- worst case
- network design problem
- minimum cost
- constant factor
- primal dual
- facility location problem
- set cover
- exact algorithms
- np hardness
- approximation ratio
- combinatorial auctions
- precedence constraints
- randomized algorithms
- open shop
- polynomial time approximation
- branch and bound
- learning algorithm
- shortest path