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 [2]	Hilfe

Suche: Series=LNCS AND Volume=4619

• 35/44-approximation for asymmetric maximum TSP with triangle inequality
  Łukasz Kowalik, Marcin Mucha
  Lecture Notes in Computer Science 4619, 2007, pp. 589-600
• On Euclidean vehicle routing with allocation
  Jan Remy, Reto Spöhel, Andreas Weißl
  Lecture Notes in Computer Science 4619, 2007, pp. 601-612
• Optimal lightweight construction of suffix arrays for constant alphabets
  Ge Nong, Sen Zhang
  Lecture Notes in Computer Science 4619, 2007, pp. 613-624
• Range non-overlapping indexing and successive list indexing
  Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
  Lecture Notes in Computer Science 4619, 2007, pp. 625-636
• Space-efficient straggler identification in round-trip data streams via Newton's identities and invertible Bloom filters
  David Eppstein, Michael T. Goodrich
  Lecture Notes in Computer Science 4619, 2007, pp. 637-648
• Dynamic TCP acknowledgment with sliding window
  Hisashi Koga
  Lecture Notes in Computer Science 4619, 2007, pp. 649-660