121 search results - page 1 / 25 » Approximating Maximum Weight Matching in Near-Linear Time |
67
Voted
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
SIAMCOMP
1998
14 years 9 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
102
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
111
click to vote
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...