Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

DOI10.1007/978-3-642-38756-2_6zbMath1303.68151arXiv1212.3889OpenAlexW2237276010MaRDI QIDQ5405914

Shashank K. Mehta, Pawan Aurora, Sumit Singh

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.3889

zbMATH Keywords

Lagrangian relaxationedge-packing problemsiterative rounding

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Constant factor approximation for the weighted partial degree bounded edge packing problem ⋮ Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem

This page was built for publication: Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds