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: Author="Hao, Jianxiu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A faster Algorithm for finding the minimum cut in a directed graph
Jianxiu Hao
,
James B. Orlin
Journal of Algorithms
17
(3), 1994, pp. 424-446
On the maximum capacity augmentation algorithm for the maximum flow problem
Donald Goldfarb
,
Jianxiu Hao
Discrete Applied Mathematics
47
, 1993, pp. 9-16
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
Donald Goldfarb
,
Jianxiu Hao
Algorithmica
8
, 1992, pp. 145-160
A faster algorithm for finding the minimum cut in a graph
Jianxiu Hao
,
James B. Orlin
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 165-174
Shortest path algorithms using dynamic breadth-first search
Donald Goldfarb
,
Jianxiu Hao
,
Sheng-Roan Kai
Networks
21
(1), 1991, pp. 29-50
Anti-stalling Pivot rules for the network simplex algorithm
Donald Goldfarb
,
Jianxiu Hao
,
Sheng-Roan Kai
Networks
20
(1), 1990, pp. 79-91