11. SODA 2000:
San Francisco, California, USA David B. Shmoys (Ed.):
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA.
ACM/SIAM 2000, ISBN 0-89871-453-2
export record as
dblp key:
Daniel Bienstock :
epsilon-Approximate linear programs: new bounds and computation.
1-2
export record as
dblp key:
conf/soda/EiglspergerFK00 export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Robin Thomas :
Digraph minors and algorithms (abstract only).
75
export record as
dblp key:
export record as
dblp key:
Neal E. Young :
K -medians, facility location, and the Chernoff-Wald bound.
86-95
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/soda/FeigenbaumKSV00 export record as
dblp key:
conf/soda/BuchsbaumCCFM00 export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
conf/soda/GolubchikKKTZ00 export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Giovanni Di Crescenzo :
Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio.
273-274
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Eran Halperin :
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs.
329-337
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Peter N. Yianilos :
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract).
361-370
export record as
dblp key:
Piotr Indyk :
Dimensionality reduction techniques for proximity problems.
371-378
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
David Gamarnik :
On deciding stability of scheduling policies in queueing systems.
467-476
export record as
dblp key:
export record as
dblp key:
Rasmus Pagh :
Faster deterministic dictionaries.
487-493
export record as
dblp key:
export record as
dblp key:
Mikkel Thorup :
Even strongly universal hashing is pretty fast.
496-497
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Mark Huber :
A faster method for sampling independent sets.
625-626
export record as
dblp key:
László Babai ,
Igor Pak :
Strong bias of group generators: an obstacle to the ``product replacement algorithm''.
627-635
export record as
dblp key:
Dana Randall ,
Gary D. Yngve :
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings.
636-645
export record as
dblp key:
Eric Rémila :
An algebraic method to compute a shortest path of local flips between two tilings.
646-653
export record as
dblp key:
export record as
dblp key:
conf/soda/Damian-IordacheP00 export record as
dblp key:
Sundar Vishwanathan :
An approximation algorithm for finding a long path in Hamiltonian graphs.
680-685
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Matthew S. Levine :
Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts.
735-742
export record as
dblp key:
export record as
dblp key:
Gene Myers :
The whole genome assembly of Drosophila.
753
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Weiping Shi ,
Chen Su :
The rectilinear Steiner arborescence problem is NP-complete.
780-787
export record as
dblp key:
Anupam Gupta :
Improved bandwidth approximation for trees.
788-793
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Philip N. Klein :
Finding the closest lattice vector when it's unusually close.
937-941
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Victor Y. Pan :
Nearly optimal computations with structured matrices.
953-962
data released under the ODC-BY 1.0 license
