Alexander Golovnev
Abstract
Assume that a group of n people is going to an excursion and our task is to seat them into buses with several constraints each saying that a pair of people does not want to see each other in the same bus. This is a well-known graph coloring problem (with n being the number of vertices) and it can be solved in O*(2n) time by the inclusion-exclusion principle as shown by Björklund, Husfeldt, and Koivisto in 2009. Another approach to solve this problem in O*(2n) time is to use the Fast Fourier Transform (FFT). For this, given a graph G one constructs a polynomial PG(x) of degree O*(2n) with the following property: G is k-colorable if and only if the coefficient of xm (for some particular value of m) in the k-th power of P(x) is nonzero. Then, it remains to compute this coefficient using FFT.
Assume now that we have additional constraints: the group of people contains several infants and these infants should be accompanied by their relatives in a bus. We show that if the number of infants is linear, then the problem can be solved in O*((2 − ε)n) time, where ε is a positive constant independent of n. We use this approach to improve known bounds for several NP-hard problems (the traveling salesman problem, the graph coloring problem, the problem of counting perfect matchings) on graphs of bounded average degree, as well as to simplify the proofs of several known results.
- Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. 2004. PRIMES is in P. Annals of Mathematics (2004), 781--793.Google Scholar
- Stefan Arnborg, Jens Lagergren, and Detlef Seese. 1991. Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 2 (1991), 308--340. Google ScholarDigital Library
- Eric Bax and Joel Franklin. 2002. A permanent algorithm with exp {Ω(n1/3/2ln n)} expected speedup for 0-1 matrices. Algorithmica 32, 1 (2002), 157--162.Google ScholarDigital Library
- Richard Bellman. 1962. Dynamic programming treatment of the travelling salesman problem. Journal of the ACM 9, 1 (January 1962), 61--63. Google ScholarDigital Library
- Andreas Björklund. 2010. Determinant sums for undirected Hamiltonicity. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS’10). 173--182. Google ScholarDigital Library
- Andreas Björklund. 2012. Counting perfect matchings as fast as Ryser. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’12). SIAM, 914--921. Google ScholarDigital Library
- Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. 2010a. Narrow sieves for parameterized paths and packings. arXiv:1007.1161 (2010).Google Scholar
- Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. 2010b. Trimmed Moebius inversion and graphs of bounded degree. Theory of Computing Systems 47, 3 (2010), 637--654. Google ScholarDigital Library
- Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. 2012. The traveling salesman problem in bounded degree graphs. ACM Transactions on Algorithms 8, 2 (2012), 18. Google ScholarDigital Library
- Andreas Björklund, Thore Husfeldt, and Mikko Koivisto. 2009. Set partitioning via inclusion-exclusion. SIAM Journal on Computing 39, 2 (2009), 546--563. Google ScholarDigital Library
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, (3rd. ed.). MIT Press. Google ScholarDigital Library
- Marek Cygan, Stefan Kratsch, and Jesper Nederlof. 2013. Fast Hamiltonicity checking via bases of perfect matchings. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC’13). 301--310. Google ScholarDigital Library
- Marek Cygan and Marcin Pilipczuk. 2010. Exact and approximate bandwidth. Theoretical Computer Science 411, 40--42 (2010), 3701--3713. Google ScholarDigital Library
- Marek Cygan and Marcin Pilipczuk. 2013. Faster exponential-time algorithms in graphs of bounded average degree. In Automata, Languages, and Programming. Lecture Notes in Computer Science, Vol. 7965. Springer, Berlin, 364--375. Google ScholarDigital Library
- Gabriel A. Dirac. 1952. Some theorems on abstract graphs. Proceedings of the London Mathematical Society 3, 1 (1952), 69--81.Google ScholarCross Ref
- Alexander Golovnev, Aleaxnder S. Kulikov, and Ivan Mihajlin. 2014. Families with infants: A general approach to solve hard partition problems. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), Lecture Notes in Computer Science, Vol. 8572. Springer, Berlin, 551--562.Google Scholar
- Michael Held and Richard M. Karp. 1962. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10, 1 (1962), 196--210.Google ScholarCross Ref
- Taisuke Izumi and Tadashi Wadayama. 2012. A new direction for counting perfect matchings. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 591--598. Google ScholarDigital Library
- Ioannis Koutis and Ryan Williams. 2009. Limits and applications of group algebras for parameterized problems. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, (ICALP 2009), Lecture Notes in Computer Science, Vol. 5555, Part I. Springer, Berlin, 653--664. Google ScholarDigital Library
- Leopold Kronecker. 1882. Grundzüge einer arithmetischen theorie der algebraischen Grössen. Journal für die reine und angewandte Mathematik 92 (1882), 1--122.Google Scholar
- Daniel Lokshtanov and Jesper Nederlof. 2010. Saving space by algebraization. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC’10). ACM, 321--330. Google ScholarDigital Library
- Johan M. M. Rooij, Hans L. Bodlaender, and Peter Rossmanith. 2009. Dynamic programming on tree decompositions using generalised fast subset convolution. In Algorithms—ESA 2009, Amos Fiat and Peter Sanders (Eds.). Lecture Notes in Computer Science, Vol. 5757. Springer, Berlin, 566--577.Google Scholar
- Herbert John Ryser. 1963. Combinatorial Mathematics. Mathematical Association of America, Washington, DC.Google Scholar
- Rocco A. Servedio and Andrew Wan. 2005. Computing sparse permanents faster. Information Processing Letters 96, 3 (2005), 89--92. Google ScholarDigital Library
- Victor Shoup. 2009. A Computational Introduction to Number Theory and Algebra (2nd. ed.). Cambridge University Press. Google ScholarDigital Library
Index Terms
- Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT
Recommendations
Infinite families of 4-chromatic Grötzsch-Sachs graphs
Let G be a 4-regular planar graph and suppose that G has a cycle decomposition S (i.e., each edge of G is in exactly one cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of S. Such graphs, called ...
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are $W[1]$-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers, whether any of these problems is fixed parameter tractable when ...
Bounds for the b-chromatic number of some families of graphs
In this paper we obtain some upper bounds for the b-chromatic number of K"1","s-free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are given in terms of either the clique number or the chromatic number of a graph ...
Comments