Approximating bounded-degree spanning trees and connected factors with leaves
DOI10.1016/j.orl.2017.01.002zbMath1409.05198OpenAlexW2577535483MaRDI QIDQ1728165
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/approximating-boundeddegree-spanning-trees-and-connected-factors-with-leaves(0518192b-c521-4eb5-a67c-ea0d08a14aa0).html
Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On some network design problems with degree constraints
- Network design with weighted degree constraints
- Network design with edge-connectivity and degree constraints
- The complexity of regular subgraph recognition
- Matching theory
- Approximating node connectivity problems via set covers
- Approximation algorithms for connected graph factors of minimum weight
- The Design of Approximation Algorithms
- Degree Bounded Network Design with Metric Costs
- Approximation Algorithms for Network Design with Metric Costs
- Survivable Network Design with Degree or Order Constraints
- Biconnectivity approximations and graph carvings
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
- Additive Approximation for Bounded Degree Survivable Network Design
- A Unified Algorithm for Degree Bounded Survivable Network Design
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Approximating bounded-degree spanning trees and connected factors with leaves
