Author:
Raghavan Prabhakar,Tompson Clark D.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. R. Aharoni, P. Erdős andN. Linial, Dual Integer Linear Programs and the Relationship between their Optima,Proceedings of the Seventeenth ACM Symposium on Theory of Computing, ACM, New York, May1985, 476–483.
2. D. Angluin andL. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings,Journal of Computer and System Sciences,19, 155–193.
3. H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,Annals of Math. Stat.,23 (1952), 493–509.
4. S. Even, A. Itai andA. Shamir, On the complexity of timetable and multi-commodity flow problems,SIAM Journal on Computing,5 (1976), 691–703.
5. Z. Füredi, Maximum degree and fractional matchings in uniform hypergraphs,Combinatorica 1 (1981), 155–162.
Cited by
598 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献