57 search results - page 6 / 12 » Combinatorial algorithms for the minimum interval cost flow ... |
124
Voted
INFORMS
2008
15 years 4 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
107
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
131
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
140
click to vote
SIAMDM
2000
15 years 3 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
146
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...