Publications

Found 238 results
Author Title Type [ Year(Asc)]
Filters: Author is Richard M. Karp  [Clear All Filters]
1978
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
1977
Karp, R. M. (1977).  Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane. Mathematics of Operations Research. 2(3), 209-224.
1976
Karp, R. M., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.
1975
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Karp, R. M., McKellar A.. C., & Wong C.. K. (1975).  Near-optimal Solutions to a 2-dimensional Placement Problem. SIAM Journal on Computing. 4(3), 271-286.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs. Bulletin of the Operations Research Society of America. 23,
Karp, R. M., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
1974
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.
Karp, R. M., & Glassey C.. R. (1974).  On the Optimality of Huffman Trees.
1973
Karp, R. M., & Hopcroft J.. E. (1973).  An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing. 2(4), 225-231.
1972
Gale, D.., & Karp R. M. (1972).  A Phenomenon in the Theory of Sorting. Journal of Computer and System Sciences. 6(2), 103-115.
Edmonds, J., & Karp R. M. (1972).  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the Association for Computing Machinery. 19(2), 248-264.

Pages