14165 search results - page 187 / 2833 » The generalized two-server problem |
118
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
117
click to vote
CAISE
2005
Springer
15 years 9 months ago
2005
Springer
. This paper aims at proposing a global view of the interoperability problem, independently of any domain. We first describe explicitly the problem, and the context in which it app...
144
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
ISIPTA
1999
IEEE
15 years 8 months ago
1999
IEEE
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
154
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...