scientific article; zbMATH DE number 742977
From MaRDI portal
Publication:4763416
Recommendations
- A General Approximation Technique for Constrained Forest Problems
- Complexity and approximation of the constrained forest problem
- A \(\frac{3}{2}\) approximation for a constrained forest problem
- A class of heuristics for the constrained forest problem
- Another greedy heuristic for the constrained forest problem
- scientific article; zbMATH DE number 1833410
- Covering a graph with a constrained forest (extended abstract)
- Approximating the Spanning k-Tree Forest Problem
- Approximating the spanning k-tree forest problem
- The maximum agreement forest problem: Approximation algorithms and computational experiments
Cited in
(36)- Approximating the maximum internal spanning tree problem
- A note on the subadditive network design problem
- Modifying edges of a network to obtain short subgraphs
- A greedy heuristic for a minimum-weight forest problem
- A data structure for bicategories, with application to speeding up an approximation algorithm
- The parsimonious property of cut covering problems and its applications
- The point-to-point connection problem - analysis and algorithms
- Rounding algorithms for covering problems
- Online constrained forest and prize-collecting network design
- On survivable network polyhedra
- New primal and dual matching heuristics
- Approximating minimum-cost graph problems with spanning tree edges
- A primal-dual approximation algorithm for generalized Steiner network problems
- A 3/2-approximation algorithm for some minimum-cost graph problems
- A stabilized column generation scheme for the traveling salesman subtour problem
- A class of heuristics for the constrained forest problem
- A \(\frac{3}{2}\) approximation for a constrained forest problem
- Fractional covers for forests and matchings
- Fast and Simple Algorithms for Weighted Perfect Matching
- Matching Based Augmentations for Approximating Connectivity Problems
- On the approximability of dense Steiner problems
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
- A General Approximation Technique for Constrained Forest Problems
- Exact methods for solving the elementary shortest and longest path problems
- Imposing Connectivity Constraints in Forest Planning Models
- Approximation Algorithms for a Network Design Problem
- Complexity and approximation of the constrained forest problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- The multi-weighted spanning tree problem
- New approximation results on graph matching and related problems
- Navigating Forest Straight-Line Programs in Constant Time
- Linear bounds for on-line Steiner problems
- Survivable networks, linear programming relaxations and the parsimonious property
- 2-approximation for prize-collecting Steiner forest
- Nearly-optimal algorithm for non-clairvoyant service with delay
- Approximation results for a min-max location-routing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763416)
