Sciweavers

14379 search results - page 2620 / 2876
» is 2000
Sort
View
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
15 years 6 months ago
Dynamic Maintenance of Maxima of 2-d Point Sets
This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase struct...
Sanjiv Kapoor
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 6 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
15 years 6 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
SIAMDM
2000
103views more  SIAMDM 2000»
15 years 6 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
SIAMJO
2000
63views more  SIAMJO 2000»
15 years 6 months ago
Pattern Search Methods for Linearly Constrained Minimization
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that con...
Robert Michael Lewis, Virginia Torczon
« Prev « First page 2620 / 2876 Last » Next »