Konstantin Makarychev
ABSTRACT
In this paper, we propose two semi-random models for the Minimum Feedback Arc Set Problem and present approximation algorithms for them. In the first model, which we call the Random Edge Flipping model, an instance is generated as follows. We start with an arbitrary acyclic directed graph and then randomly flip its edges (the adversary may later un-flip some of them). In the second model, which we call the Random Backward Edge model, again we start with an arbitrary acyclic graph but now add new random backward edges (the adversary may delete some of them). For the first model, we give an approximation algorithm that finds a solution of cost (1+ δ) OPT + n polylog n, where OPT is the cost of the optimal solution. For the second model, we give an approximation algorithm that finds a solution of cost O(planted) + n polylog n, where planted is the cost of the planted solution. Additionally, we present an approximation algorithm for semi-random instances of Minimum Directed Balanced Cut.
- Amit Agarwal, Moses Charikar, Konstantin Makarychev, and Yury Makarychev. O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pages 573--581, 2005. Google Scholar
Digital Library
- Nir Ailon, Moses Charikar, and Alantha Newman. Aggregating inconsistent information: Ranking and clustering. J. ACM, 55(5):23:1--23:27, November 2008. Google ScholarDigital Library
- Noga Alon and Nabil Kahale. A spectral technique for coloring random 3-colorable graphs. In Proceedings of the Twenty-Sixth ACM Symposium on Theory of Computing, pages 346--355, 1994. Google ScholarDigital Library
- Noga Alon, Michael Krivelevich, and Benny Sudakov. List coloring of random and pseudo-random graphs. Combinatorica, 19:453--472, 1999.Google ScholarCross Ref
- Noga Alon, Konstantin Makarychev, Yury Makarychev, and Assaf Naor. Quadratic forms on graphs. Invent. Math, 163:486--493, 2005.Google Scholar
- 0}BCCFVAditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, and Aravindan Vijayaraghavan. Detecting high log-densities: an $O(n^1/4)$ approximation for densest k-subgraph. In Proceedings of the 42nd ACM Symposium on Theory of Computing, pages 201--210, 2010. Google ScholarDigital Library
- Thang Nguyen Bui, F. Thomson Leighton, Soma Chaudhuri, and Michael Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7:171--191, June 1987. Google ScholarDigital Library
- Mark Braverman and Elchanan Mossel. Noisy sorting without resampling. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 268--276, 2008. Google ScholarDigital Library
- Ravi B. Boppana. Eigenvalues and graph bisection: An average-case analysis. In 28th Annual Symposium on Foundations of Computer Science, pages 280--285, 1987. Google ScholarDigital Library
- Bonnie Berger and Peter W. Shor. Approximation alogorithms for the maximum acyclic subgraph problem. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 236--243, 1990. Google ScholarDigital Library
- Avrim Blum and Joel Spencer. Coloring random and semi-random k-colorable graphs. J. Algorithms, 19:204--234, September 1995. Google ScholarDigital Library
- Don Coppersmith, Lisa Fleischer, and Atri Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pages 776--782, 2006. Google ScholarDigital Library
- Anne Condon and Richard Karp. Algorithms for graph partitioning on the planted partition model. In Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, volume 1671 of Lecture Notes in Computer Science, pages 221--232. Springer Berlin / Heidelberg, 1999. Google ScholarDigital Library
- Moses Charikar, Konstantin Makarychev, and Yury Makarychev. On the advantage over random for maximum acyclic subgraph. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 625--633, 2007. Google ScholarDigital Library
- Amin Coja-Oghlan. A spectral heuristic for bisecting random graphs. Random Structures & Algorithms, 29(3):351--398, 2006. Google ScholarDigital Library
- M. E. Dyer and A. M. Frieze. Fast solution of some random NP-hard problems. In 27th Annual Symposium on Foundations of Computer Science, pages 331--336, 1986. Google ScholarDigital Library
- Tassos Dimitriou and Russell Impagliazzo. Go with the winners for graph bisection. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 510--520, 1998. Google ScholarDigital Library
- Guy Even, Joseph Seffi Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics. J. ACM, 47(4):585--616, July 2000. Google ScholarDigital Library
- Uriel Feige and Joe Kilian. Heuristics for finding large independent sets, with applications to coloring semi-random graphs. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 674--683, 1998. Google ScholarDigital Library
- Uriel Feige and Robert Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms, 16:195--208, March 2000. Google ScholarDigital Library
- Venkatesan Guruswami, Rajsekar Manokaran, and Prasad Raghavendra. Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pages 573--582, 2008. Google ScholarDigital Library
- Mark Jerrum and Gregory Sorkin. Simulated annealing for graph bisection. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 94--103, 1993. Google ScholarDigital Library
- V. Kann. On the Approximability of NP-complete Optimization Problems. PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992.Google Scholar
- R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972.Google ScholarCross Ref
- Alexandra Kolla, Konstantin Makarychev, and Yury Makarychev. How to play unique games against a semi-random adversary: Study of semi-random models of unique games. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, pages 443--452, 2011. Google ScholarDigital Library
- Claire Kenyon-Mathieu and Warren Schudy. How to rank with few errors. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pages 95--103, 2007. Google ScholarDigital Library
- Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, and Maurizio Talamo. Near optimal algorithms for finding minimum steiner trees on random graphs. In Mathematical Foundations of Computer Science, pages 501--511, London, UK, UK, 1986. Springer-Verlag. Google Scholar
- John G. Kemeny and J. Laurie Snell. Mathematical models in the social sciences. Blaisdell Publ., 1963.Google Scholar
- Tom Leighton and Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46:787--832, November 1999. Google ScholarDigital Library
- Konstantin Makarychev. Quadratic Forms on Graphs and Their Applications. PhD thesis, Department of Computing Science, Princeton, University, Princeton, NJ, USA, 2008. Google ScholarDigital Library
- Frank McSherry. Spectral partitioning of random graphs. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 529--537, 2001. Google ScholarDigital Library
- Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan. Approximation algorithms for semi-random graph partitioning problems. In Proceedings of the 44th symposium on Theory of Computing, pages 367--384, 2012. Google ScholarDigital Library
- Claire Mathieu and Warren Schudy. Correlation clustering with noisy input. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 712--728, 2010. Google ScholarDigital Library
- Alantha Newman. Cuts and orderings: On semidefinite relaxations for the linear ordering problem. In Klaus Jansen, Sanjeev Khanna, JoséD.P. Rolim, and Dana Ron, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 3122 of Lecture Notes in Computer Science, pages 195--206. Springer Berlin Heidelberg, 2004.Google Scholar
- Thomas L Saaty. A scaling method for priorities in hierarchical structures. Journal of Mathematical Psychology, 15(3):234 -- 281, 1977.Google ScholarCross Ref
- Thomas L. Saaty. Relative measurement and its generalization in decision making: Why pairwise comparisons are central in mathematics for the measurement of intangible factors -- the analytic hierarchy/network process. Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas (RACSAM), 102(2):251--318, 2008.Google Scholar
- Paul D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281--288, 1995.Google ScholarCross Ref
- S. Seshu and M.B. Reed. Linear graphs and electrical networks. Addison-Wesley series in the engineering science. Addison-Wesley Pub. Co., 1961.Google Scholar
- Stephen H. Unger. A Study of Asynchronous Logical Feedback Networks. Technical report. Research Laboratory of Electronics, Massachusetts Inst. of Technology, 1957.Google Scholar
- D. Younger. Minimum feedback arc sets for a directed graph. IEEE Transactions on Circuit Theory, 10(2):238 -- 245, jun 1963.Google ScholarCross Ref
Index Terms
- Sorting noisy data with partial information
Recommendations
Approximation algorithms for semi-random partitioning problems
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computingIn this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real-world instances. The model is more flexible than the semi-random model of Feige and Kilian and planted ...
Constant factor approximation for balanced cut in the PIE model
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingWe propose and study a new semi-random semi-adversarial model for Balanced Cut, a planted model with permutation invariant random edges (PIE). Our model is much more general than planted models considered previously. Consider a set of vertices V ...
Local ratio method on partial set multi-cover
In this paper, we study the minimum partial set multi-cover problem (PSMC). Given an element set E, a collection of subsets $${\mathcal {S}}\subseteq 2^E$$S⊆2E, a cost $$c_S$$cS on each set $$S\in {\mathcal {S}}$$SźS, a covering requirement $$r_e$$re ...
Comments