Aspects of a multivariate complexity analysis for rectangle tiling

DOI10.1016/j.orl.2011.06.001zbMath1235.90128OpenAlexW2140486831MaRDI QIDQ408398

Rolf Niedermeier, Michael Dom, André Nichterlein

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.001

zbMATH Keywords

computational complexityNP-hardnesscombinatorial algorithmsfixed-parameter tractability

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
• Compressed histograms with arbitrary bucket layouts for selectivity estimation
• New approximation algorithm for RTILE problem.
• Parametrized complexity theory.
• Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
• Reflections on Multivariate Algorithmics and Problem Parameterization
• Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
• Rectangular Tiling in Multidimensional Arrays
• Parameterized and Exact Computation
• Automata, Languages and Programming

This page was built for publication: Aspects of a multivariate complexity analysis for rectangle tiling