Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference57 articles.
1. Aggarwal A.Proc. 25th ACM Sympos. Theory Comput.(1993) (ACM Press)
2. Aggarwal A. , Garg N. A scaling technique for better network design.Proc. 5th Annual ACM-SIAM Sympos. Discrete Algorithms(1994) 233 240
3. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
4. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
Cited by
102 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast Broadcast in Highly Connected Networks;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12
3. Ghost Value Augmentation for k-Edge-Connectivity;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing;SIAM Journal on Computing;2024-05-20
5. Clustering graph data: the roadmap to spectral techniques;Discover Artificial Intelligence;2024-01-22