Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem
DOI10.1007/978-3-319-48749-6_14zbMath1483.90168OpenAlexW2544347916MaRDI QIDQ2958313
Rajiv Raman, Monalisa Jena, Pawan Aurora
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_14
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing on binary strings
- Approximation hardness of dominating set problems in bounded degree graphs
- A partial k-arboretum of graphs with bounded treewidth
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Partial Degree Bounded Edge Packing Problem
- Iterative Packing for Demand and Hypergraph Matching
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio
- Approximation algorithms for NP-complete problems on planar graphs
- Paths, Trees, and Flowers
- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds
- SOFSEM 2006: Theory and Practice of Computer Science
This page was built for publication: Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem
