The minimum feasible tileset problem
From MaRDI portal
Publication:666670
DOI10.1007/s00453-018-0460-3zbMath1436.68398arXiv1409.8524OpenAlexW2963070347MaRDI QIDQ666670
Stefan Kratsch, Manuel Sorge, Yann Disser
Publication date: 11 March 2019
Published in: Algorithmica, Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8524
Integer programming (90C10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- The minimum feasible tileset problem
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- An application of simultaneous diophantine approximation in combinatorial optimization
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Balanced vertex-orderings of graphs
- Parametrized complexity theory.
- On the degrees of the vertices of a directed graph
- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Twins in Subdivision Drawings of Hypergraphs
- Integer Programming with a Fixed Number of Variables
- Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
- Faster Algebraic Algorithms for Path and Packing Problems
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Minkowski's Convex Body Theorem and Integer Programming
- Hypergraph planarity and the complexity of drawing venn diagrams
- Matroids and Subset Interconnection Design
- Degree-Constrained Orientations of Embedded Graphs
- Large Neighborhood Local Search for the Maximum Set Packing Problem
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
- Parameterized Algorithms
- On Planar Supports for Hypergraphs
- Degree-constrained orientations of embedded graphs
This page was built for publication: The minimum feasible tileset problem
