scientific article; zbMATH DE number 1405893
From MaRDI portal
Publication:4938889
zbMath0938.65085MaRDI QIDQ4938889
Publication date: 25 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationsurvey paperNP-harddiscrete optimizationapproximation algorithmsrandomized roundingpolynomial time algorithmsquality of approximation
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Complexity and performance of numerical algorithms (65Y20)
Related Items (6)
LP based heuristics for the multiple knapsack problem with assignment restrictions ⋮ Pricing commodities ⋮ Analysis of randomized protocols for conflict-free distributed access ⋮ Approximability of the robust representatives selection problem ⋮ The smallest singular value of inhomogeneous square random matrices ⋮ The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
This page was built for publication: