Oblivious Algorithms for the Maximum Directed Cut Problem
This paper introduces a special family of randomized algorithms for Max DICUT that we call oblivious algorithms. Let the bias of a vertex be the ratio between the total weight of its outgoing edges and the total weight of all its edges. An oblivious algorithm selects at random in which side of the cut to place a vertex v, with probability that only depends on the bias of v, independently of other vertices. The reader may observe that the algorithm that ignores the bias and chooses each side with probability 1/2 has an approximation ratio of 1/4, whereas no oblivious algorithm can have an approximation ratio better than 1/2 (with an even directed cycle serving as a negative example). We attempt to characterize the best approximation ratio achievable by oblivious algorithms, and present results that are nearly tight. The paper also discusses natural extensions of the notion of oblivious algorithms, and extensions to the more general problem of Max 2-AND.
KeywordsLinear programming Local Algorithms
Work supported in part by The Israel Science Foundation (grant No. 873/08).
- 2.Alimonti, P.: Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT. In: Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 2–14 (1997) Google Scholar
- 5.Austrin, P.: Conditional Inapproximability and Limited Independence. Ph.D. thesis, KTH—Royal Institute of Technology, Sweden (2008) Google Scholar
- 7.Bansal, N., Fleischer, L.K., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further improvements in competitive guarantees for QoS buffering. In: Proceding of the 31st International Colloquium on Automata, Languages, and Programming, pp. 196–207. Springer, Berlin (2004) CrossRefGoogle Scholar
- 9.Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrained submodular maximization. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 649–658 (2012) Google Scholar
- 10.Crescenzi, P., Silvestri, R., Trevisan, L.: To weight or not to weight: where is the question. In: Proceedings of the 4th IEEE Israel Symposium on Theory of Computing and Systems, pp. 68–77 (1996) Google Scholar
- 13.Halperin, E., Zwick, U.: Combinatorial approximation algorithms for the maximum directed cut problem. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1–7. Society for Industrial and Applied Mathematics, Philadelphia (2001) Google Scholar
- 19.Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 597–606. ACM, New York (2011) Google Scholar
- 21.Mossel, E., O’Donnell, R., Oleszkiewicz, K.: Noise stability of functions with low influences: invariance and optimality. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 21–30. IEEE Comput. Soc., Washington (2005) Google Scholar