An approximation algorithm for covering vertices by \(4^+\)-paths
From MaRDI portal
Publication:6606209
DOI10.1007/978-3-031-49611-0_33MaRDI QIDQ6606209
Zhi-Zhong Chen, Mingyang Gong, G.-H. Lin, Lusheng Wang
Publication date: 16 September 2024
Cites Work
- Approximating maximum edge 2-coloring in simple graphs
- The two-equal-disjoint path cover problem of matching composition network
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Efficient bounds for the stable set, vertex cover and set packing problems
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Path cover problems with length cost
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Nontrivial path covers of graphs: existence, minimization and maximization
- 8/7-approximation algorithm for (1,2)-TSP
- A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs
- Approximation algorithms for covering vertices by long paths
This page was built for publication: An approximation algorithm for covering vertices by \(4^+\)-paths
