Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
From MaRDI portal
Publication:3646228
DOI10.1007/978-3-642-04355-0_23zbMath1261.68168OpenAlexW1947006564MaRDI QIDQ3646228
Neal E. Young, Christos Koufogiannakis
Publication date: 19 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_23
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (8)
Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Optimizing social welfare for network bargaining games in the face of instability, greed and idealism ⋮ Approximability of sparse integer programs ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists ⋮ Iterative Packing for Demand and Hypergraph Matching
This page was built for publication: Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
