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
Hilfe
Suche: Series=LNCS AND Volume=4168
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finite termination of ''augmenting path'' algorithms in the presence of irrational problem data
Brian C. Dean
,
Michel X. Goemans
,
Nicole Immorlica
Lecture Notes in Computer Science
4168
, 2006, pp. 268-279
Dynamic programming and fast matrix multiplication
Frederic Dorn
Lecture Notes in Computer Science
4168
, 2006, pp. 280-291
Near-entropy hotlink assignments
Karim Douïeb
,
Stefan Langerman
Lecture Notes in Computer Science
4168
, 2006, pp. 292-303
Subspace sampling and relative-error matrix approximation: Column-row-based methods
Petros Drineas
,
Michael W. Mahoney
,
S. Muthukrishnan
Lecture Notes in Computer Science
4168
, 2006, pp. 304-314
Finding total unimodularity in optimization problems solved by linear programs
Christoph Dürr
,
Mathilde Hurand
Lecture Notes in Computer Science
4168
, 2006, pp. 315-326
Preemptive online scheduling: Optimal algorithms for all speeds
Tomás̑ Ebenlendr
,
Wojciech Jawor
,
Jiȓí Sgall
Lecture Notes in Computer Science
4168
, 2006, pp. 327-339
On the complexity of the multiplication method for monotone CNF/DNF dualization
Khaled M. Elbassioni
Lecture Notes in Computer Science
4168
, 2006, pp. 340-351
Lower and upper bounds on FIFO buffer management in QoS switches
Matthias Englert
,
Matthias Westermann
Lecture Notes in Computer Science
4168
, 2006, pp. 352-363
Graph coloring with rejection
Leah Epstein
,
Asaf Levin
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
4168
, 2006, pp. 364-375
A doubling dimension threshold
\Theta (\log\log n)
for augmented graph navigability
Pierre Fraigniaud
,
Emmanuelle Lebhar
,
Zvi Lotker
Lecture Notes in Computer Science
4168
, 2006, pp. 376-386
Violator spaces: Structure and algorithms
Bernd Gärtner
,
Jiȓí Matous̑ek
,
Leo Rüst
,
Petr S̑kovron̑
Lecture Notes in Computer Science
4168
, 2006, pp. 387-398
Region-restricted clustering for geographic data mining
Joachim Gudmundsson
,
Marc van Kreveld
,
Giri Narasimhan
Lecture Notes in Computer Science
4168
, 2006, pp. 399-410
An
O(n^3 (\log\log n/\log n)^{5/4})
time algorithm for all pairs shortest paths
Yijie Han
Lecture Notes in Computer Science
4168
, 2006, pp. 411-417
Cheating by men in the Gale-Shapley stable matching algorithm
Chien-Chung Huang
Lecture Notes in Computer Science
4168
, 2006, pp. 418-431
Approximating almost all instances of MAX-CUT within a ratio above the Håstad threshold
A.C. Kaporis
,
L.M. Kirousis
,
E.C. Stavropoulos
Lecture Notes in Computer Science
4168
, 2006, pp. 432-443
Enumerating spanning and connected subsets in graphs and matroids
L. Khachiyan
,
E. Boros
,
K. Borys
,
K. Elbassioni
,
V. Gurvich
,
K. Makino
Lecture Notes in Computer Science
4168
, 2006, pp. 444-455
Less hashing, same performance: Building a better Bloom filter
Adam Kirsch
,
Michael Mitzenmacher
Lecture Notes in Computer Science
4168
, 2006, pp. 456-467
A unified approach to approximating partial covering problems
Jochen Könemann
,
Ojas Parekh
,
Danny Segev
Lecture Notes in Computer Science
4168
, 2006, pp. 468-479
Navigating low-dimensional and hierarchical population networks
Ravi Kumar
,
David Liben-Nowell
,
Andrew Tomkins
Lecture Notes in Computer Science
4168
, 2006, pp. 480-491
Popular matchings in the capacitated house allocation problem
David F. Manlove
,
Colin T.S. Sng
Lecture Notes in Computer Science
4168
, 2006, pp. 492-503
Inner-product based wavelet synopses for range-sum queries
Yossi Matias
,
Daniel Urieli
Lecture Notes in Computer Science
4168
, 2006, pp. 504-515
Approximation in preemptive stochastic online scheduling
Nicole Megow
,
Tjark Vredeveld
Lecture Notes in Computer Science
4168
, 2006, pp. 516-527
Greedy in approximation algorithms
Julián Mestre
Lecture Notes in Computer Science
4168
, 2006, pp. 528-539
I/O-efficient undirected shortest paths with unbounded edge lengths
Ulrich Meyer
,
Norbert Zeh
Lecture Notes in Computer Science
4168
, 2006, pp. 540-551
Stochastic shortest paths via quasi-convex maximization
Evdokia Nikolova
,
Jonathan A. Kelner
,
Matthew Brand
,
Michael Mitzenmacher
Lecture Notes in Computer Science
4168
, 2006, pp. 552-563
Seiten
<
1
2
3
>