50 search results - page 1 / 10 » A randomized algorithm for the on-line weighted bipartite ma... |
ICALP
1991
Springer
13 years 11 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...