No label defined (Q5091235)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7561569

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561569

Statements

scholarly article

0 references

0 references

publication date

21 July 2022

0 references

full work available at URL

https://arxiv.org/abs/1904.09562

0 references

zbMATH Keywords

approximation algorithms

0 references

knapsack

0 references

subset sum

0 references

MaRDI profile type

MaRDI publication profile

0 references

Geometric applications of a matrix-searching algorithm

0 references

Necklaces, convolutions, and \(X+Y\)

0 references

0 references

Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky

0 references

On Problems Equivalent to (min,+)-Convolution

0 references

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

0 references

A faster FPTAS for the unbounded knapsack problem

0 references

Reducibility among Combinatorial Problems

0 references

An efficient fully polynomial approximation scheme for the Subset-Sum problem.

0 references

A new fully polynomial time approximation scheme for the Knapsack problem

0 references

Improved dynamic programming in connection with an FPTAS for the knapsack problem

0 references

0 references

Fast Approximation Algorithms for Knapsack Problems

0 references

A Subquadratic Approximation Scheme for Partition

0 references

Faster all-pairs shortest paths via circuit complexity

0 references

Identifiers

10.4230/LIPIcs.ICALP.2019.76

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091235

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091235&oldid=36832984"