Families with Infants

DOI10.1145/2847419zbMath1445.68163arXiv1410.2209OpenAlexW1747610753MaRDI QIDQ4962612

Alexander Golovnev, Ivan Mihajlin, Alexander S. Kulikov

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

algorithmstraveling salesmanfast Fourier transformchromatic numberNP-hard problemcounting perfect matchings

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical methods for discrete and fast Fourier transforms (65T50) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

This page was built for publication: Families with Infants