Citation: T. Jiang et al., A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application, SIAM J COMP, 30(6), 2000, pp. 1942-1961
Authors:
Dyer, M
Goldberg, LA
Greenhill, C
Jerrum, M
Mitzenmacher, M
Citation: M. Dyer et al., An extension of path coupling and its application to the Glauber dynamics for graph colorings, SIAM J COMP, 30(6), 2000, pp. 1962-1975
Authors:
Rutcor, B
Gurvich, V
Khachiyan, L
Makino, K
Citation: B. Rutcor et al., Dual-bounded generating problems: Partial and multiple transversals of a hypergraph, SIAM J COMP, 30(6), 2000, pp. 2036-2050
Citation: A. Srinivasan et Cp. Teo, A constant-factor approximation algorithm for packet routing and balancinglocal vs. global criteria, SIAM J COMP, 30(6), 2000, pp. 2051-2068
Citation: Cb. Chu et R. La, Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms, SIAM J COMP, 30(6), 2000, pp. 2069-2083
Citation: Rl. Milidiu et Es. Laber, The warm-up algorithm: A lagrangian construction of length restricted Huffman codes, SIAM J COMP, 30(5), 2000, pp. 1405-1426
Citation: D. Peleg et V. Rubinovich, A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction, SIAM J COMP, 30(5), 2000, pp. 1427-1442
Citation: Me. Dyer et S. Sen, Fast and optimal parallel multidimensional search in prams with applications to linear programming and related problems, SIAM J COMP, 30(5), 2000, pp. 1443-1461
Authors:
Bonet, ML
Esteban, JL
Galesi, N
Johannsen, J
Citation: Ml. Bonet et al., On the relative complexity of resolution refinements and cutting planes proof systems, SIAM J COMP, 30(5), 2000, pp. 1462-1484