Constant factor approximation for the weighted partial degree bounded edge packing problem

DOI10.1007/s10878-017-0206-1zbMath1412.90128OpenAlexW2770160826MaRDI QIDQ1631679

Pawan Aurora, Monalisa Jena, Rajiv Raman

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0206-1

zbMATH Keywords

combinatorial optimizationmaximum matchingpacking problemapproximation algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing on binary strings
• 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
• Reducibility among Combinatorial Problems
• 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