A Subquadratic Approximation Scheme for Partition

DOI10.1137/1.9781611975482.5zbMath1431.68155arXiv1804.02269OpenAlexW2795466116WikidataQ112313932 ScholiaQ112313932MaRDI QIDQ5236186

Marcin Mucha, Michał Włodarczyk, Karol Węgrzycki

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

Approximation schemes for subset-sums ratio problems ⋮ Approximating subset sum ratio via subset sum computations ⋮ On the complexity of scheduling problems with a fixed number of parallel identical machines ⋮ Unnamed Item ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Approximating Approximate Pattern Matching

This page was built for publication: A Subquadratic Approximation Scheme for Partition