Login / Signup
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation.
Vladimir I. Khandeev
Published in:
NUMTA (2) (2019)
Keyphrases
</>
polynomial time approximation
np hard
approximation algorithms
error bounds
pairwise
optimal solution
identical machines
objective function
data structure
computational complexity
linear constraints
bin packing
approximation ratio
sequential quadratic programming