Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

Approximating Global Quadratic Optimization with Convex Quadratic Constraints

Journal of Global Optimization

Lagrangian bounds in multiextremal polynomial and discrete optimization problems

Journal of Global Optimization

A deterministic annealing algorithm for approximating a solution of the max-bisection problem

Neural Networks

Coloring 2-colorable hypergraphs with a sublinear number of colors

Nordic Journal of Computing

A combinatorial algorithm for MAX CSP

Information Processing Letters

Graph partition strategies for generalized mean field inference

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence

Noise stability of functions with low in.uences invariance and optimality

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Clustering with qualitative information

Journal of Computer and System Sciences - Special issue: Learning theory 2003

Approximating the fixed linear crossing number

Discrete Applied Mathematics

Categorical skylines for streaming data

Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Soft Edge Coloring

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

An effective error resilient packetization scheme for progressive mesh transmission over unreliable networks

Journal of Computer Science and Technology

Optimal Incentives for Participation with Type-Dependent Externalities

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics

An approximation algorithm for max p-section

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Energy efficient monitoring in sensor networks

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

RSEDP: an effective hybrid data placement algorithm for large-scale storage systems

The Journal of Supercomputing

A new Lagrangian net algorithm for solving max-bisection problems

Journal of Computational and Applied Mathematics

Derandomization of dimensionality reduction and SDP based algorithms

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Complexity of approximating CSP with balance / hard constraints

Proceedings of the 5th conference on Innovations in theoretical computer science