114 search results - page 11 / 23 » Engineering Algorithms for Approximate Weighted Matching |
107
click to vote
ICN
2005
Springer
15 years 5 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
102
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
104
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
120
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...