A constant factor approximation algorithm for a class of classification problems

DOI10.1145/335305.335397zbMath1296.68078OpenAlexW1981676508MaRDI QIDQ3192037

Éva Tardos, Anupam Gupta

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.335397

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

Local search: is brute-force avoidable?

This page was built for publication: A constant factor approximation algorithm for a class of classification problems