论文信息 - Combinatorial and Network Algorithms

Combinatorial and Network Algorithms

We shall discuss three classes of algorithms: (A) Network algorithms which can be adapted to solve various cost functions. (B) Auction-type algorithms most suitable for parallel and distributed computations. (C) Stochastic algorithms such as simulated annealing and its siblings.

T. C. Hu

[1] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .

[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3] T. C. Hu,et al. Combinatorial algorithms , 1982 .

[4] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .

[5] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[6] Refael Hassin. Solution Bases of Multiterminal Cut Problems , 1988, Math. Oper. Res..

[7] T. C. Hu,et al. BINARY TREES OPTIMUM UNDER VARIOUS CRITERIA , 1979 .

[8] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[9] L. B. Wilson,et al. The stable marriage problem , 1971, Commun. ACM.