Families with Infants: A General Approach to Solve Hard Partition Problems

DOI10.1007/978-3-662-43948-7_46zbMath1410.68143arXiv1311.2456OpenAlexW1527908019MaRDI QIDQ5167772

Alexander Golovnev, Ivan Mihajlin, Alexander S. Kulikov

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.2456

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Faster exponential-time algorithms in graphs of bounded average degree

This page was built for publication: Families with Infants: A General Approach to Solve Hard Partition Problems