Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=1671

• Completeness and robustness properties of min-wise independent permutations
  Andrei Z. Broder, Michael Mitzenmacher
  Lecture Notes in Computer Science 1671, 1999, pp. 1-10
• Low discrepancy sets yield approximate min-wise independent permutation families
  Michael Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
  Lecture Notes in Computer Science 1671, 1999, pp. 11-15
• Independent sets in hypergraphs with applications to routing via fixed paths
  Noga Alon, Uri Arad, Yossi Azar
  Lecture Notes in Computer Science 1671, 1999, pp. 16-27
• Approximating minimum Manhattan networks
  Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
  Lecture Notes in Computer Science 1671, 1999, pp. 28-38
• Approximation of multi-color discrepancy
  Benjamin Doerr, Anand Srivastav
  Lecture Notes in Computer Science 1671, 1999, pp. 39-50
• A polynomial time approximation scheme for the multiple knapsack problem
  Hans Kellerer
  Lecture Notes in Computer Science 1671, 1999, pp. 51-62
• Set cover with requirements and costs evolving over time
  Milena Mihail
  Lecture Notes in Computer Science 1671, 1999, pp. 63-72
• Multicoloring planar graphs and partial k-trees
  Magnús M. Halldórsson, Guy Kortsarz
  Lecture Notes in Computer Science 1671, 1999, pp. 73-84
• Testing the diameter of graphs
  Michal Parnas, Dana Ron
  Lecture Notes in Computer Science 1671, 1999, pp. 85-96
• Improved testing algorithms for monotonicity
  Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
  Lecture Notes in Computer Science 1671, 1999, pp. 97-108
• Linear consistency testing
  Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
  Lecture Notes in Computer Science 1671, 1999, pp. 109-120
• Improved bounds for sampling contingency tables
  Ben Morris
  Lecture Notes in Computer Science 1671, 1999, pp. 121-129
• Probabilistic and deterministic approximations of the permanent
  Avi Wigderson
  Lecture Notes in Computer Science 1671, 1999, pp. 130-130
• Improved derandomization of BPP using a hitting set generator
  Oded Goldreich, Avi Wigderson
  Lecture Notes in Computer Science 1671, 1999, pp. 131-137
• Probabilistic construction of small strongly sum-free sets via large Sidon sets
  Andreas Baltz, Tomasz Schoen, Anand Srivastav
  Lecture Notes in Computer Science 1671, 1999, pp. 138-143
• Stochastic machine scheduling: Performance guarantees for LP-based priority policies
  Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
  Lecture Notes in Computer Science 1671, 1999, pp. 144-155
• Efficient redundant assignments under fault-tolerance constraints
  Dimitris A. Fotakis, Paul G. Spirakis
  Lecture Notes in Computer Science 1671, 1999, pp. 156-167
• Scheduling with machine cost
  Csanád Imreh, John Noga
  Lecture Notes in Computer Science 1671, 1999, pp. 168-176
• A linear time approximation scheme for the job shop scheduling problem
  Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
  Lecture Notes in Computer Science 1671, 1999, pp. 177-188
• Randomized rounding for semidefinite programs - Variations on the MAX CUT example
  Uriel Feige
  Lecture Notes in Computer Science 1671, 1999, pp. 189-196
• Hardness results for the power range assignment problem in packet radio networks
  Andrea E.F. Clementi, Paolo Penna, Riccardo Silvestri
  Lecture Notes in Computer Science 1671, 1999, pp. 197-208
• A new approximation algorithm for the demand routing and slotting problem with unit demands on rings
  Christine T. Cheng
  Lecture Notes in Computer Science 1671, 1999, pp. 209-220
• Algorithms for graph partitioning on the planted partition model
  Anne Condon, Richard M. Karp
  Lecture Notes in Computer Science 1671, 1999, pp. 221-232
• A randomized time-work optimal parallel algorithm for finding a minimum spanning forest
  Seth Pettie, Vijaya Ramachandran
  Lecture Notes in Computer Science 1671, 1999, pp. 233-244
• Fast approximate PCPs for multidimensional bin-packing problems
  Tuğkan Batu, Ronitt Rubinfeld, Patrick White
  Lecture Notes in Computer Science 1671, 1999, pp. 245-256