Sciweavers

ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 3 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
14 years 3 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
ISAAC
1993
Springer
95views Algorithms» more  ISAAC 1993»
14 years 3 months ago
Constructing Degree-3 Spanners with Other Sparseness Properties
Gautam Das, Paul J. Heffernan
ISAAC
1993
Springer
134views Algorithms» more  ISAAC 1993»
14 years 3 months ago
Weighted Independent Perfect Domination on Cocomparability Graphs
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
ISAAC
1993
Springer
87views Algorithms» more  ISAAC 1993»
14 years 3 months ago
Finding the Shortest Watchman Route in a Simple Polygon
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
Svante Carlsson, Håkan Jonsson, Bengt J. Nil...
ISAAC
1993
Springer
103views Algorithms» more  ISAAC 1993»
14 years 3 months ago
Reaching a Goal with Directional Uncertainty
Mark de Berg, Mark H. Overmars, Leonidas J. Guibas...