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, A.V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On implementing the push-relabel method for the maximum flow problem
B.V. Cherkassky
,
A.V. Goldberg
Algorithmica
19
, 1997, pp. 390-410
Improved approximation algorithms for network design problems
M.X. Goemans
,
A.V. Goldberg
,
S. Plotkin
,
D.B. Shmoys
,
é. Tardos
,
D.P. Williamson
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 223-232
Interior-point methods in parallel computation
A.V. Goldberg
,
S.A. Plotkin
,
D.B. Shmoys
,
é. Tardos
Technical Report (STAN-CS-89-1259), 1989, May
Finding minimum-cost circulations by canceling negative cycles
A.V. Goldberg
,
R.E. Tarjan
Journal of the ACM
36
(4), 1989, October, pp. 873-886
Combinatorial algorithms for the generalized circulation problem
A.V. Goldberg
,
S.A. Plotkin
,
é. Tardos
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 432-443
Sublinear-time parallel algorithms for matching and related problems
A.V. Goldberg
,
S.A. Plotkin
,
P.M. Vaidya
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 174-185
Parallel
(\Delta+1)
-coloring of constant-degree graphs
A.V. Goldberg
,
S.A. Plotkin
Information Processing Letters
25
(4), 1987, June, pp. 241-245
A new approach to the maximum flow problem
A.V. Goldberg
,
R.E. Tarjan
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 136-146
Finding a maximum density subgraph
A.V. Goldberg
misc