Sciweavers

ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
13 years 4 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup
ALGORITHMICA
2002
116views more  ALGORITHMICA 2002»
13 years 4 months ago
Budget Management with Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastav...
ALGORITHMICA
2002
109views more  ALGORITHMICA 2002»
13 years 4 months ago
A Near-Linear Area Bound for Drawing Binary Trees
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
Timothy M. Chan
ALGORITHMICA
2002
104views more  ALGORITHMICA 2002»
13 years 4 months ago
Security of Quantum Key Distribution against All Collective Attacks
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very ...
Eli Biham, Michel Boyer, Gilles Brassard, Jeroen v...
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 4 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 4 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 4 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
13 years 4 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 4 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...