23 search results - page 3 / 5 » stoc 1993 |
STOC
1993
ACM
13 years 9 months ago
1993
ACM
d Abstract) Arthur W. Chou1 and Ker-I Ko2 March 9, 1993
STOC
1993
ACM
13 years 9 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...