Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference44 articles.
1. F. Barahona, Separating from the dominant of the spanning tree polytope, Operations Research Letters 12 (1992) 201–203.
2. F. Barahona, Packing spanning trees, Mathematics of Operation Research 20 (1) (1995) 104–115.
3. A.A. Benczúr, D.R. Karger, Approximates—t min-cuts in Õ(n 2) time, Proceedings of the 28th ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 47–55.
4. B. Bollobás, Random Graphs, Harcourt. Brace and Janovich, New York, 1985.
5. H. Chernoff, A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics 23 (1952) 493–509.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fast Algorithms via Dynamic-Oracle Matroids;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid;Integer Programming and Combinatorial Optimization;2023
3. Space-Time Sampling for Network Observability;IEEE Transactions on Control of Network Systems;2022
4. Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback;Neural Computation;2020-09
5. Faster Matroid Intersection;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11