Sciweavers

WADS
2001
Springer
113views Algorithms» more  WADS 2001»
14 years 3 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
14 years 3 months ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
WADS
2001
Springer
97views Algorithms» more  WADS 2001»
14 years 3 months ago
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
Songrit Maneewongvatana, David M. Mount
WADS
2001
Springer
105views Algorithms» more  WADS 2001»
14 years 3 months ago
Voronoi Diagrams for Moving Disks and Applications
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
Menelaos I. Karavelas
WADS
2001
Springer
124views Algorithms» more  WADS 2001»
14 years 3 months ago
Deciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
Wolfgang Espelage, Frank Gurski, Egon Wanke
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
14 years 3 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 3 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
14 years 3 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
WADS
2001
Springer
72views Algorithms» more  WADS 2001»
14 years 3 months ago
Seller-Focused Algorithms for Online Auctioning
Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Mi...