170 search results - page 5 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
FORTE
2007
13 years 9 months ago
2007
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows i...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
GIS
1998
ACM
13 years 11 months ago
1998
ACM
We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incrementa...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
TCS
2010
13 years 2 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...