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: Author="Goldberg, Andrew V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum cost flows in graphs with unit capacities
Andrew V. Goldberg
,
Haim Kaplan
,
Sagi Hed
,
Robert E. Tarjan
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 406-419
Robust distance queries on massive networks
Daniel Delling
,
Andrew V. Goldberg
,
Thomas Pajor
,
Renato F. Werneck
Lecture Notes in Computer Science
8737
, 2014, pp. 321-333
Algorithms for hub label optimization
Maxim Babenko
,
Andrew V. Goldberg
,
Anupam Gupta
,
Viswanath Nagarajan
Lecture Notes in Computer Science
7965
, 2013, pp. 69-80
PHAST: Hardware-accelerated shortest path trees
Daniel Delling
,
Andrew V. Goldberg
,
Andreas Nowatzyk
,
Renato F. Werneck
Journal Parallel Distributed Computing
73
(7), 2013, pp. 940-952
Separating hierarchical and general hub labelings
Andrew V. Goldberg
,
Ilya Razenshteyn
,
Ruslan Savchenko
Lecture Notes in Computer Science
8087
, 2013, pp. 469-479
Hierarchical hub labelings for shortest paths
Ittai Abraham
,
Daniel Delling
,
Andrew V. Goldberg
,
Renato F.Werneck
Lecture Notes in Computer Science
7501
, 2012, pp. 24-35
VC-dimension and shortest path algorithms
Ittai Abraham
,
Daniel Delling
,
Amos Fiat
,
Andrew V. Goldberg
,
Renato F. Werneck
Lecture Notes in Computer Science
6755
, 2011, pp. 690-699
Maximum flows by incremental breadth-first search
Andrew V. Goldberg
,
Sagi Hed
,
Haim Kaplan
,
Robert E. Tarjan
,
Renato F. Werneck
Lecture Notes in Computer Science
6942
, 2011, pp. 457-468
The partial augment-relabel algorithm for the maximum flow problem
Andrew V. Goldberg
Lecture Notes in Computer Science
5193
, 2008, pp. 466-477
A practical shortest path algorithm with linear expected time
Andrew V. Goldberg
SIAM Journal on Computing
37
(5), 2008, pp. 1637-1655
Derandomization of auctions
Gagan Aggarwal
,
Amos Fiat
,
Andrew V. Goldberg
,
Jason D. Hartline
,
Nicole Immorlica
,
Madhu Sudan
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 619-625
A lower bound on the competitive ratio of truthful auctions
Andrew V. Goldberg
,
Jason D. Hartline
,
Anna R. Karlin
,
Michael Saks
Lecture Notes in Computer Science
2996
, 2004, pp. 644-655
Truthful and competitive double auctions
Kaustubh Deshmukh
,
Andrew V. Goldberg
,
Jason D. Hartline
,
Anna R. Karlin
Lecture Notes in Computer Science
2461
, 2002, pp. 361-373
Competitive generalized auctions
Amos Fiat
,
Andrew V. Goldberg
,
Jason D. Hartline
,
Anna R. Karlin
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 72-81
Competitive auctions for multiple digital goods
Andrew V. Goldberg
,
Jason D. Hartline
Lecture Notes in Computer Science
2161
, 2001, pp. 416-427
Cut tree algorithms: An experimental study
Andrew V. Goldberg
,
Kostas Tsioutsiouliklis
Journal of Algorithms
38
(1), 2001, pp. 51-83
A simple shortest path algorithm with linear average time
Andrew V. Goldberg
Lecture Notes in Computer Science
2161
, 2001, pp. 230-241
Shortest path algorithms: Engineering aspects
Andrew V. Goldberg
Lecture Notes in Computer Science
2223
, 2001, pp. 502-513
Buckets, heaps, lists, and monotone priority queues
Boris V. Cherkassky
,
Andrew V. Goldberg
,
Craig Silverstein
SIAM Journal on Computing
28
(4), 1999, pp. 1326-1346
Combinatorial algorithms test sets (CATS): The ACM/EATCS platform for experimental research
Andrew V. Goldberg
,
Bernard M.E. Moret
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 913-914
Flows in undirected unit capacity networks
Andrew V. Goldberg
,
Satish Rao
SIAM Journal on Discrete Mathematics
12
(1), 1999, pp. 1-5
Cut tree algorithms
Andrew V. Goldberg
,
Kostas Tsioutsiouliklis
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 376-385
Selecting problems for algorithm evaluation
Andrew V. Goldberg
Lecture Notes in Computer Science
1668
, 1999, pp. 1-11
An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
Andrew V. Goldberg
,
Jeffrey D. Oldham
,
Serge Plotkin
,
Cliff Stein
Lecture Notes in Computer Science
1412
, 1998, pp. 338-352
Beyond the flow decomposition barrier
Andrew V. Goldberg
,
Satish Rao
Journal of the ACM
45
(5), 1998, pp. 783-797
Seiten 1
2
3
>