The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
On the advantage over a random assignment
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating Global Quadratic Optimization with Convex Quadratic Constraints
Journal of Global Optimization
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
Journal of Global Optimization
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Automated Lesson Construction from Electronic Textbooks
IEEE Transactions on Knowledge and Data Engineering
On the advantage over a random assignment
Random Structures & Algorithms
A PTAS for the minimization of polynomials of fixed degree over the simplex
Theoretical Computer Science - Approximation and online algorithms
The UGC hardness threshold of the ℓp Grothendieck problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation results for the weighted P4 partition problem
Journal of Discrete Algorithms
Congestion control in utility fair networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
The UGC Hardness Threshold of the Lp Grothendieck Problem
Mathematics of Operations Research
3D visualization of semantic metadata models and ontologies
GD'04 Proceedings of the 12th international conference on Graph Drawing
Approximation results for the weighted P4 partition problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |