Faster Algorithms for Semi-matching Problems (Extended Abstract)

DOI10.1007/978-3-642-14165-2_16zbMath1287.05148OpenAlexW1605516979MaRDI QIDQ3587378

Bundit Laekhanukit, Jittat Fakcharoenphol, Danupon Nanongkai

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks ⋮ Faster Algorithms for Semi-Matching Problems ⋮ On the distributed complexity of the semi-matching problem ⋮ Brief Announcement: Distributed Approximations for the Semi-matching Problem ⋮ Online Collaborative Filtering on Graphs ⋮ On Computing an Optimal Semi-matching

This page was built for publication: Faster Algorithms for Semi-matching Problems (Extended Abstract)