ε -optimization schemes and L-bit precision (extended abstract)

DOI10.1145/335305.335377zbMath1296.90106OpenAlexW1990479925MaRDI QIDQ3192026

Andreas S. Schulz, James B. Orlin, Sudipta Sengupta

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335377

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (2)

A survey on offline scheduling with rejection ⋮ Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP

This page was built for publication: ε -optimization schemes and L-bit precision (extended abstract)