Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 221-238
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost2009
- Approximating weighted matchings in parallelInformation Processing Letters, 2006
- On the Equivalence between the Primal-Dual Schema and the Local Ratio TechniqueSIAM Journal on Discrete Mathematics, 2005
- Local ratioACM Computing Surveys, 2004
- Distributed Weighted Matching2004
- Parallel approximation algorithms for maximum weighted matching in general graphsInformation Processing Letters, 2000
- One for the Price of Two: a Unified Approach for Approximating Covering ProblemsAlgorithmica, 2000
- Low diameter graph decompositionsCombinatorica, 1993
- A fast and simple randomized parallel algorithm for maximal matchingInformation Processing Letters, 1986
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965