Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 526-538
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Graph Distances in the Data-Stream ModelSIAM Journal on Computing, 2009
- Towards a theoretical foundation for Laplacian-based manifold methodsJournal of Computer and System Sciences, 2008
- On graph problems in a semi-streaming modelTheoretical Computer Science, 2005
- A linear-time approximation algorithm for weighted matchings in graphsACM Transactions on Algorithms, 2005
- Data Streams: Algorithms and ApplicationsFoundations and Trends® in Theoretical Computer Science, 2005
- A simpler linear time 2/3−ε approximation for maximum weight matchingInformation Processing Letters, 2004
- Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesSIAM Journal on Discrete Mathematics, 2000
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- On the fractional matching polytope of a hypergraphCombinatorica, 1993
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965