Výsledky vyhledávání - "$K$-approximating sets and functions"

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy

Autoři: Halman, Nir Nir Halman

Přispěvatelé: Halman, Nir Nir Halman

Zdroj: Theoretical Computer Science. 645:41-47

Témata: dynamic programming, 2. Zero hunger, Approximate counting, 0211 other engineering and technologies, integer knapsack, 02 engineering and technology, ddc:004, bounding constraints, $K$-approximating sets and functions

Popis souboru: application/pdf

Přístupová URL adresa: http://www.sciencedirect.com/science/article/pii/S0304397516302511
http://www.optimization-online.org/DB_FILE/2015/12/5231.pdf
https://dl.acm.org/doi/10.1016/j.tcs.2016.06.015
https://dblp.uni-trier.de/db/journals/tcs/tcs645.html#Halman16
https://www.sciencedirect.com/science/article/pii/S0304397516302511
https://core.ac.uk/display/62922892
https://dblp.uni-trier.de/db/conf/approx/approx2016.html#Halman16
https://drops.dagstuhl.de/opus/volltexte/2016/6632/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.9

A Faster FPTAS for #Knapsack

Autoři: Gawrychowski, Pawel Markin, Liran Weimann, Oren a další

Přispěvatelé: Gawrychowski, Pawel Markin, Liran Weimann, Oren a další

Témata: knapsack, approximate counting, K-approximating sets and functions

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.64

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2018.64
https://nbn-resolving.org/urn:nbn:de:0030-drops-90687
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.64