Strongly Polynomial FPTASes for Monotone Dynamic Programs

In this paper we introduce a framework for the automatic generation of Strongly Polynomial Fully Polynomial Time Approximation Schemes (SFPTASes) for monotone dynamic programs. While some ad-hoc SFPTASes for specific problems are already known, this is the first framework yielding such SFPTASes. In...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 84; H. 10; S. 2785 - 2819
Hauptverfasser:	Alon, Tzvi, Halman, Nir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2022 Springer Nature B.V
Schlagworte:	Agents (artificial intelligence) Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematical analysis Mathematics of Computing Polynomials Theory of Computation Strongly polynomial algorithms approximation sets and functions Dynamic programming
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!