Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

FOCS
2010
IEEE

favoriteEmaildiscussreport

171views Theoretical Computer Science» more FOCS 2010»

Approximating Maximum Weight Matching in Near-Linear Time

13 years 9 months ago

Approximating Maximum Weight Matching in Near-Linear Time

Download www.eecs.umich.edu

Ran Duan, Seth Pettie

Real-time Traffic

FOCS 2010 | Theoretical Computer Science |

claim paper

Related Content

» NearLinear Time Construction of Sparse Neighborhood Covers

» ConstantTime Approximation Algorithms via Local Improvements

» Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegr...

» Maximum Weighted Matching with Interference Constraints

» Engineering Algorithms for Approximate Weighted Matching

» Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» A local approximation algorithm for maximum weight matching

» An adjustable linear time parallel algorithm for maximum weight bipartite matching

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Ran Duan, Seth Pettie

Comments (0)