17760 search results - page 209 / 3552 » A Generalization of the Massey-Ding Algorithm |
114
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
133
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
138
click to vote
TOMACS
2008
15 years 4 months ago
2008
abstractly; it is intended to provide a basis for implementing efficient and scalable parallel algorithms that correctly simulate DEVS models. Categories and Subject Descriptors: I...
113
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
155
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...