scientific article; zbMATH DE number 2081093

zbMATH Open1052.90602MaRDI QIDQ4474206

Uri Zwick

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2245/22450057.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Combinatorial optimization (90C27)

Related Items (4)

Basc: constrained approximation by semidefinite programming ⋮ A robust algorithm for semidefinite programming ⋮ Approx-SVP in ideal lattices with pre-processing ⋮ The RPR2 rounding technique for semidefinite programs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Sublinear time algorithms for approximate semidefinite programming 👍 👎
• Semidefinite programming 👍 👎
• Approximation Algorithms and Semidefinite Programming 👍 👎
• Semidefinite Programming and Approximation Algorithms: A Survey 👍 👎
• Semidefinite Programming 👍 👎
• Semidefinite programming and its applications to NP problems 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474206)