Approximation algorithms for covering vertices by long paths
From MaRDI portal
Cites work
- 8/7-approximation algorithm for (1,2)-TSP
- \(k\)-path partitions in trees
- A 21/16-Approximation for the Minimum 3-Path Partition Problem
- A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- An improved approximation algorithm for the minimum 3-path partition problem
- Approximation algorithms for the directed path partition problems
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
- Efficient bounds for the stable set, vertex cover and set packing problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Nontrivial path covers of graphs: existence, minimization and maximization
- Path cover problems with length cost
- Path cover problems with length cost
- STACS 2005
- The path partition problem and related problems in bipartite graphs
- The two-equal-disjoint path cover problem of matching composition network
Cited in
(7)- Approximation algorithms for non-sequential star packing problems
- Covering vertices by 4^+-paths: a simpler local search coupled with a more delicate amortization
- Approximation algorithms for the maximum path cover problem using long paths
- Approximately covering vertices by order-5 or longer paths
- Path cover using only short paths
- Approximation algorithms for the k^+-star packing problem
- Approximately partitioning vertices into short paths
This page was built for publication: Approximation algorithms for covering vertices by long paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586665)
