Abstract
The Minimum Linear Arrangement (MLA) problem involves embedding a given graph on the integer line so that the sum of the edge lengths of the embedded graph is minimized. Most layout problems are either intractable or not known to be tractable, parameterized by the treewidth of the input graph. We investigate MLA with respect to three parameters that provide more structure than treewidth. In particular, we give a factor (1 + ε)-approximation algorithm for MLA parameterized by (ε, k), where k is the vertex cover number of the input graph. By a similar approach, we obtain two FPT algorithms that exactly solve MLA parameterized by, respectively, the max leaf and edge clique cover numbers of the input graph.
- Christoph Ambühl, Monaldo Mastrolilli, and Ola Svensson. 2011. Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM Journal on Computing 40, 2, 567--596. Google Scholar
Digital Library
- Hans L. Bodlaender, Michael R. Fellows, and Michael T. Hallett. 1994. Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy. In Proceedings of the 26th Annual Symposium on the Theory of Computing (STOC’94). 449--458. Google Scholar
Digital Library
- Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, and Dimitrios M. Thilikos. 2012. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems 50, 3, 420--432. Google Scholar
Digital Library
- Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. 2013. Preprocessing for treewidth: A combinatorial analysis through kernelization. SIAM Journal on Discrete Mathematics 27, 4, 2108--2142.Google Scholar
Cross Ref
- Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, and Satish Rao. 2006. ℓ22 spreading metrics for vertex ordering problems. In SODA. 1018--1027. Google Scholar
Digital Library
- Reinhard Diestel. 2000. Graph Theory. Springer-Verlag.Google Scholar
- Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer. Google Scholar
Digital Library
- Uriel Feige and James R. Lee. 2007. An improved approximation ratio for the minimum linear arrangement problem. Information Processing Letters 101, 1, 26--29. Google Scholar
Digital Library
- Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, and Carsten Thomassen. 2011. On the complexity of some colorful problems parameterized by treewidth. Information and Computation 209, 2, 143--153. Google Scholar
Digital Library
- Michael R. Fellows, Bart M. P. Jansen, and Frances A. Rosamond. 2013. Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European Journal of Combinatorics 34, 3, 541--566. Google Scholar
Digital Library
- Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, and Saket Saurabh. 2009. The complexity ecology of parameters: An illustration using bounded Max Leaf number. Theory of Computing Systems 45, 4, 822--848. Google Scholar
Digital Library
- Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. 2008. Graph layout problems parameterized by vertex cover. In ISAAC. 294--305. Google Scholar
Digital Library
- Henning Fernau. 2008. Parameterized algorithmics for linear arrangement problems. Discrete Applied Mathematics 156, 17, 3166--3177. Google Scholar
Digital Library
- Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. Google Scholar
Digital Library
- Jens Gramm, Jiong Guo, Falk Hüffner, and Rolf Niedermeier. 2008. Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13. Google Scholar
Digital Library
- Gregory Gutin, Arash Rafiey, Stefan Szeider, and Anders Yeo. 2007. The linear arrangement problem parameterized above guaranteed value. Theory of Computing Systems 41, 3, 521--538. Google Scholar
Digital Library
- Falk Hüffner, Christian Komusiewicz, and Manuel Sorge. 2015. Finding highly connected subgraphs. In Proceedings of SOFSEM 2015: Theory and Practice of Computer Science—41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. 254--265.Google Scholar
Cross Ref
- Daniel J. Kleitman and Douglas B. West. 1991. Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 4, 1, 99--106. Google Scholar
Digital Library
- H. W. Lenstra. 1983. Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 538--548. Google Scholar
Digital Library
- Satish Rao and Andréa W. Richa. 2004. New approximation techniques for some linear ordering problems. SIAM Journal on Computing 34, 2, 388--404. Google Scholar
Digital Library
Index Terms
Tractable Parameterizations for the Minimum Linear Arrangement Problem
Recommendations
On multiway cut parameterized above lower bounds
We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the node multiway cut problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that ...
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex set T of size at most k that hits all cycles in the graph. The first fixed-parameter algorithm for FVS in undirected graphs appeared in a monograph of ...
Dominating set is fixed parameter tractable in claw-free graphs
We show that the Dominating Set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K"1","3, the complete bipartite graph on four vertices where the two parts have one and three vertices, ...






Comments