On the Complexity of Approximate Sum of Sorted List

DOI10.1007/978-3-642-38756-2_29zbMath1303.68070arXiv1112.0520MaRDI QIDQ5405940

Bin Fu

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms