Forest covers
From MaRDI portal
Cites work
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
- A catalog of steiner tree formulations
- A minimum length covering subgraph of a network
- Approximating the Minimum Tour Cover with a Compact Linear Program
- Approximating the tree and tour covers of a graph
- Approximation Algorithms for Min–Max Tree Partition
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximations for minimum and min-max vehicle routing problems
- Graph covering using bounded size subgraphs
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Improved upper bounds for vertex cover
- Min-max tree covers of graphs.
- New approximation algorithms for the minimum cycle cover problem
- On approximation properties of the Independent set problem for degree 3 graphs
- On the hardness of approximating minimum vertex cover
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Reducibility among combinatorial problems
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
- The probabilistic method
This page was built for publication: Forest covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266647)
