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

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 84; číslo 10; s. 2785 - 2819
Hlavní autori:	Alon, Tzvi, Halman, Nir
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!