Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model

13 years 8 months ago

Download hal.inria.fr

ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 669

Leah Epstein, Asaf Levin, Julián Mestre, Da

Real-time Traffic

Algorithms | One-pass Algorithms | STACS 2010 | Theoretical Computer Science | Weight Matching Problem |

claim paper

» Graphical Models and Point Pattern Matching

» When LP is the Cure for Your Matching Woes Improved Bounds for Stochastic Matchings

» Stochastic Online Scheduling on Parallel Machines

» Low complexity stable scheduling algorithms for networks of input queued switches with no ...

» Approximation in Preemptive Stochastic Online Scheduling

» Simultaneous approximations for adversarial and stochastic online budgeted allocation

» Constantfactor approximation algorithms for identifying dynamic communities

» A Novel Model for Orientation Field of Fingerprints

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	STACS
Authors	Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev

Comments (0)

Sciweavers

Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model

Algorithms | One-pass Algorithms | STACS 2010 | Theoretical Computer Science | Weight Matching Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers