117
click to vote
COCOON
15 years 2 months ago
2008 Springer 
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
109
click to vote
COCOON
15 years 2 months ago
2008 Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
124
Voted
COCOON
15 years 2 months ago
2008 Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
87
Voted
COCOON
15 years 2 months ago
2008 Springer
We use nontrivial connections between the theory of computing and the finescale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in f...
104
Voted
COCOON
15 years 2 months ago
2008 Springer 
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
|
Combinatorics