Author:
Hajiaghayi Mohammad Taghi,Räcke Harald
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference12 articles.
1. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev, O(logn)-approximation algorithms for Min Uncut, Min 2CNF Deletion, and directed cut problems, in: Proc. 37th ACM Symp. on Theory of Computing (STOC), 2005, pp. 573–581
2. S. Arora, S. Rao, U. Vazirani, Expander flows, geometric embeddings, and graph partitionings, in: Proc. 36th ACM Symp. on Theory of Computing (STOC), 2004, pp. 222–231
3. S. Chawla, A. Gupta, H. Räcke, An improved approximation to sparsest cut, in: Proc. 16th ACM–SIAM Symp. on Discrete Algorithms (SODA), 2005, pp. 102–111
4. J. Cheriyan, H. Karloff, Y. Rabani, Approximating directed multicuts, in: Proc. 4nd IEEE Symp. on Foundations of Computer Science (FOCS), 2001, pp. 320–328
5. Minimal multicut and maximal integer multiflow: A survey;Costa;J. Oper. Res.,2005
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献