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á bibliografie

Vydáno v:	Algorithmica Ročník 84; číslo 10; s. 2785 - 2819
Hlavní autoři:	Alon, Tzvi, Halman, Nir
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2022 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!