ASIAN
1999
Springer
14 years 10 months ago
1999
Springer
AAECC
1999
Springer
14 years 10 months ago
1999
Springer
AAECC
1999
Springer
14 years 10 months ago
1999
Springer
AAECC
1999
Springer
14 years 10 months ago
1999
Springer
AAECC
1999
Springer
14 years 10 months ago
1999
Springer
STOC
1999
ACM
14 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
STOC
1999
ACM
14 years 10 months ago
1999
ACM
STOC
1999
ACM
14 years 10 months ago
1999
ACM
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
STOC
1999
ACM
14 years 10 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
STOC
1999
ACM
14 years 10 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...