Sciweavers

STOC
1998
ACM
167views Algorithms» more  STOC 1998»
13 years 8 months ago
An Improved Approximation Algorithm for Multiway Cut
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...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
STOC
1998
ACM
99views Algorithms» more  STOC 1998»
13 years 8 months ago
Quantum vs. Classical Communication and Computation
Harry Buhrman, Richard Cleve, Avi Wigderson
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
13 years 8 months ago
The Power of a Pebble: Exploring and Mapping Directed Graphs
Michael A. Bender, Antonio Fernández, Dana ...
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
13 years 8 months ago
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
STOC
1998
ACM
79views Algorithms» more  STOC 1998»
13 years 8 months ago
Multicasting in Heterogeneous Networks
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch S...
STOC
1998
ACM
92views Algorithms» more  STOC 1998»
13 years 8 months ago
The Cost of the Missing Bit: Communication Complexity with Help
László Babai, Thomas P. Hayes, Peter...
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 8 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
13 years 8 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
13 years 8 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi