Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference15 articles.
1. A linear time approximation algorithm for the weighted vertex cover problem;Bar-Yehuda;J. Algorithms,1981
2. M. Dawande, P. Keskinocak, S. Tayur, On the Biclique Problem in Bipartite Graphs, Carnegie-Mellon University, 1997
3. N. Garg, V. V. Vazirani, M. Yannakakis, Multiway cuts in directed and node weighted graphs, in, Proceedings of the 21st International Colloquium on Automata, Languages and Programming, 1994, 487, 498
4. Approximate max-flow min-(multi)cut theorems and their applications;Garg;SIAM J. Comput.,1996
5. A new approach to the maximum flow problem;Goldberg;J. Assoc. Comput. Mach.,1988
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximating power node-deletion problems;Theoretical Computer Science;2024-10
2. Core Decomposition and Maintenance in Bipartite Graphs;Tsinghua Science and Technology;2023-04
3. Efficient Maximum Signed Biclique Identification;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
4. Approximation algorithm for minimum q-dominator partization problem;Discrete Mathematics, Algorithms and Applications;2023-01-09
5. Approximating Power Node-Deletion Problems;Lecture Notes in Computer Science;2023