Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the sum of the largest eigenvalues of a symmetric matrix
SIAM Journal on Matrix Analysis and Applications
Combinatorial properties and complexity of a max-cut approximation
European Journal of Combinatorics
A Note on Extreme Correlation Matrices
SIAM Journal on Matrix Analysis and Applications
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Laplacian eigenvalues and the maximum cut problem
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B - Special issue: Festschrift in Honor of Philip Wolfe part II: studies in nonlinear programming
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Solving the max-cut problem using eigenvalues
Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
SIAM Review
On the facial structure of the set of correlation matrices
SIAM Journal on Matrix Analysis and Applications
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
P-Complete Approximation Problems
Journal of the ACM (JACM)
A Combinatorial Design Approach to MAXCUT
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Geometric Approach to Betweenness
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Derandomizing semidefinite programming based approximation algorithms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Graph Theory With Applications
Graph Theory With Applications
How good is the Goemans-Williamson MAX CUT algorithm?
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Watermarking techniques for intellectual property protection
DAC '98 Proceedings of the 35th annual Design Automation Conference
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
ACM SIGACT News
Identifying gene regulatory networks from experimental data
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Path optimization and near-greedy analysis for graph partitioning: an empirical study
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new way to use semidefinite programming with applications to linear equations mod p
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The 2-catalog segmentation problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Forensic engineering techniques for VLSI CAD tools
Proceedings of the 37th Annual Design Automation Conference
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Constructing worst case instances for semidefinite programming based approximation algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Edit distance between two RNA structures
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
On the integrality ratio of semidefinite relaxations of MAX CUT
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On semidefinite programming relaxations for graph coloring and vertex cover
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Readings in hardware/software co-design
Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation
Computational Optimization and Applications
On Semidefinite Programming Relaxations of (2+p)-SAT
Annals of Mathematics and Artificial Intelligence
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
Relaxations of the Satisfiability Problem Using Semidefinite Programming
Journal of Automated Reasoning
Semidefinite Programming Relaxation for NonconvexQuadratic Programs
Journal of Global Optimization
Approximating Global Quadratic Optimization with Convex Quadratic Constraints
Journal of Global Optimization
Enhancing RLT relaxations via a new class of semidefinite cuts
Journal of Global Optimization
Generating Convex Polynomial Inequalities for Mixed 0–1 Programs
Journal of Global Optimization
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
Journal of Global Optimization
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Computational Experience with Ill-Posed Problems in Semidefinite Programming
Computational Optimization and Applications
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Random MAX SAT, random MAX CUT, and their phase transitions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Performance Guarantees of Local Search for Multiprocessor Scheduling
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cutting Planes for Mixed 0-1 Semidefinite Programs
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Image Labeling and Grouping by Minimizing Linear Functionals over Cones
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Random Instance Generation for MAX 3SAT
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Instant recognition of polynominal time solvability, half integrality and 2-approximations
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
An approximation algorithm for MAX DICUT with given sizes of parts
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
63-Approximation Algorithm for MAX DICUT
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
From Quartets to Phylogenetic Trees
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Some Afterthoughts on Hopfield Networks
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Computational Forensic Techniques for Intellectual Property Protection
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
The Complexity of the Matching-Cut Problem
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Cluster Graph Modification Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Convex Relaxations for Binary Image Partitioning and Perceptual Grouping
Proceedings of the 23rd DAGM-Symposium on Pattern Recognition
Unsupervised Image Partitioning with Semidefinite Programming
Proceedings of the 24th DAGM Symposium on Pattern Recognition
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
Discrete Applied Mathematics
Semidefinite programming for discrete optimization and matrix completion problems
Discrete Applied Mathematics
The side-chain positioning problem: a semidefinite programming formulation with new rounding schemes
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
ACM Transactions on Mathematical Software (TOMS)
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The Lazy Bureaucrat scheduling problem
Information and Computation
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations
Computational Optimization and Applications
A Branch and Bound Method for Solving Integer Separable Concave Problems
Computational Optimization and Applications
Tutorial on computational complexity
Interfaces
Journal of Global Optimization
An approximation algorithm for scheduling two parallel machines with capacity constraints
Discrete Applied Mathematics
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
SDPARA: semiDefinite programming algorithm paRAllel version
Parallel Computing
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing
Complexity results on a paint shop problem
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
Statistics and Computing
Correlation Clustering: maximizing agreements via semidefinite programming
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximating the cut-norm via Grothendieck's inequality
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Theoretical Computer Science - Latin American theorotical informatics
Identifying early buyers from purchase data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Graph partition strategies for generalized mean field inference
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Journal of Algorithms
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
Mechanism design for software agents with complete information
Decision Support Systems - Special issue: Decision theory and game theory in agent design
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
A low-level hybridization between memetic algorithm and VNS for the max-cut problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
The method of extremal structure on the k-maximum cut problem
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Derivation of the Lewenstein-Sanpera Decomposition via Semidefinite Programming
Quantum Information Processing
Lagrangian Smoothing Heuristics for Max-Cut
Journal of Heuristics
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
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sharing Classifiers among Ensembles from Related Problem Domains
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
Computational Optimization and Applications
Stochastic Organization of Output Codes in Multiclass Learning Problems
Neural Computation
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming
Computational Optimization and Applications
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
Neural Computation
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Semidefinite programming based approaches to the break minimization problem
Computers and Operations Research
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Exploiting semidefinite relaxations in constraint programming
Computers and Operations Research
Properties of symmetric fitness functions
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
Very sparse random projections
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Processing Letters
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics
Using Max Cut to Enhance Rooted Trees Consistency
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
Randomized algorithms and NLP: using locality sensitive hash function for high speed noun clustering
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Scaling distributional similarity to large corpora
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A genetic system based on simulated crossover of sequences of two-bit genes
Theoretical Computer Science
Learning action models from plan examples using weighted MAX-SAT
Artificial Intelligence
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Theoretical Computer Science
A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
INFORMS Journal on Computing
Ensemble Pruning Via Semi-definite Programming
The Journal of Machine Learning Research
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems
The Journal of Machine Learning Research
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Playing games with approximation algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Annals of Mathematics and Artificial Intelligence
Approximating almost all instances of MAX-CUT within a ratio above the håstad threshold
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial algorithms for web search engines: three success stories
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Similarity-aware query allocation in sensor networks with multiple base stations
DMSN '07 Proceedings of the 4th workshop on Data management for sensor networks: in conjunction with 33rd International Conference on Very Large Data Bases
Approximation algorithms for maximum cut with limited unbalance
Theoretical Computer Science
Approximating the fixed linear crossing number
Discrete Applied Mathematics
Note: On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
Journal of Combinatorial Theory Series A
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Triangle-free subcubic graphs with minimum bipartite density
Journal of Combinatorial Theory Series B
An efficient solver for weighted Max-SAT
Journal of Global Optimization
Algorithm 875: DSDP5—software for semidefinite programming
ACM Transactions on Mathematical Software (TOMS)
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sums of squares based approximation algorithms for MAX-SAT
Discrete Applied Mathematics
Efficiently solving convex relaxations for MAP estimation
Proceedings of the 25th international conference on Machine learning
Graph transduction via alternating minimization
Proceedings of the 25th international conference on Machine learning
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
Journal of Discrete Algorithms
A modified VNS metaheuristic for max-bisection problems
Journal of Computational and Applied Mathematics
A discrete filled function algorithm for approximate global solutions of max-cut problems
Journal of Computational and Applied Mathematics
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
Hybridizing the cross-entropy method: An application to the max-cut problem
Computers and Operations Research
Improved spectral relaxation methods for binary quadratic optimization problems
Computer Vision and Image Understanding
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A Large Neighborhood Search Heuristic for Graph Coloring
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cuts for Conic Mixed-Integer Programming
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximating Maximum Subgraphs without Short Cycles
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Local-Search 2-Approximation for 2-Correlation-Clustering
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Client-Friendly Classification over Random Hyperplane Hashes
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
On hard instances of approximate vertex cover
ACM Transactions on Algorithms (TALG)
Global equilibrium search applied to the unconstrained binary quadratic optimization problem
Optimization Methods & Software
A geometric characterization of "optimality-equivalent" relaxations
Journal of Global Optimization
A global continuation algorithm for solving binary quadratic programming problems
Computational Optimization and Applications
On the Approximation Resistance of a Random Predicate
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
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
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
Encouraging Cooperation in Sharing Supermodular Costs
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
ACM SIGACT News
Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Column subset selection, matrix factorization, and eigenvalue optimization
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximation bound for quadratic optimization problems with orthogonality constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Drawing (Complete) Binary Tanglegrams
Graph Drawing
Advanced Scatter Search for the Max-Cut Problem
INFORMS Journal on Computing
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Integrality gaps for Sherali-Adams relaxations
Proceedings of the forty-first annual ACM symposium on Theory of computing
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Randomly supported independence and resistance
Proceedings of the forty-first annual ACM symposium on Theory of computing
Dualize it: software for automatic primal and dual conversions of conic programs
Optimization Methods & Software
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
Journal of Global Optimization
k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
MAX-2-SAT: how good is Tabu search in the worst-case?
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Optimization Methods & Software - GLOBAL OPTIMIZATION
Approximability Distance in the Space of H-Colourability Problems
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Unsupervised and semi-supervised multi-class support vector machines
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Conflict Resolution in the Scheduling of Television Commercials
Operations Research
IEEE Transactions on Signal Processing
Blind channel estimation in orthogonally coded MIMO-OFDM systems: a semidefinite relaxation approach
IEEE Transactions on Signal Processing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Cluster graph modification problems
Discrete Applied Mathematics
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Knowledge Based Image Annotation Refinement
Journal of Signal Processing Systems
Bounding Probability of Small Deviation: A Fourth Moment Approach
Mathematics of Operations Research
Efficiently searching for similar images
Communications of the ACM
Maximum cut in fuzzy nature: Models and algorithms
Journal of Computational and Applied Mathematics
Max k-cut and approximating the chromatic number of random graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A parallel interior point decomposition algorithm for block angular semidefinite programs
Computational Optimization and Applications
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Binary positive semidefinite matrices and associated integer polytopes
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Vertex cover resists SDPs tightened by local hypermetric inequalities
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A novel graph-based image annotation refinement algorithm
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
TACO: tunable approximate computation of outliers in wireless sensor networks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A reduced-complexity MIMO receiver via channel ordering
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A convex optimization approach to blind channel shortening in multicarrier modulations
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A convex optimization approach to blind channel shortening in multicarrier modulations
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Solutions to quadratic minimization problems with box and integer constraints
Journal of Global Optimization
The UGC Hardness Threshold of the Lp Grothendieck Problem
Mathematics of Operations Research
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Random hyperplane projection using derived dimensions
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Brief paper: Convex relaxations for mixed integer predictive control
Automatica (Journal of IFAC)
Online generation of locality sensitive hash signatures
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Mutation Hopfield neural network and its applications
Information Sciences: an International Journal
Journal of Global Optimization
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A polynomial time approximation scheme for k-consensus clustering
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Reconstructing approximate phylogenetic trees from quartet samples
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
GRAMS3: an efficient framework for XML structural similarity search
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
The positive semidefinite Grothendieck problem with rank constraint
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Improved inapproximability for submodular maximization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating linear threshold predicates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximate Lasserre integrality gap for unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Better gap-hamming lower bounds via better round elimination
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Solving the maxcut problem by the global equilibrium search
Cybernetics and Systems Analysis
Quartets MaxCut: A Divide and Conquer Quartets Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
Mathematics of Operations Research
Optimal pricing in the presence of local network effects
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
Computers and Operations Research
Simulating Quantum Correlations with Finite Communication
SIAM Journal on Computing
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Approximating Maximum Subgraphs without Short Cycles
SIAM Journal on Discrete Mathematics
SIAM Journal on Optimization
Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
SIAM Journal on Optimization
Theta Bodies for Polynomial Ideals
SIAM Journal on Optimization
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
SIAM Journal on Optimization
Knapsack problem with probability constraints
Journal of Global Optimization
A new Lagrangian net algorithm for solving max-bisection problems
Journal of Computational and Applied Mathematics
Theory and applications of b-bit minwise hashing
Communications of the ACM
Model decomposition and reduction tools for large-scale networks in systems biology
Automatica (Journal of IFAC)
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ATLAS: a probabilistic algorithm for high dimensional similarity search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the forty-third annual ACM symposium on Theory of computing
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Efficient online locality sensitive hashing via reservoir counting
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Coding of Image Feature Descriptors for Distributed Rate-efficient Visual Correspondences
International Journal of Computer Vision
Fast locality-sensitive hashing
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Nonmonotone submodular maximization via a structural continuous greedy algorithm
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Proactive defense of insider threats through authorization management
Proceedings of 2011 international workshop on Ubiquitous affective awareness and intelligent interaction
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Journal of Global Optimization
A Second-Order Cone Programming Method for Multiuser Detection Problem
Wireless Personal Communications: An International Journal
Global optimality conditions and optimization methods for quadratic integer programming problems
Journal of Global Optimization
Revised GRASP with path-relinking for the linear ordering problem
Journal of Combinatorial Optimization
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
SIAM Journal on Optimization
Randomly Supported Independence and Resistance
SIAM Journal on Computing
Approximating Semidefinite Packing Programs
SIAM Journal on Optimization
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
SIAM Journal on Imaging Sciences
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Efficient combination of probabilistic sampling approximations for robust image segmentation
DAGM'06 Proceedings of the 28th conference on Pattern Recognition
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Eigenspaces from seriated graphs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Approximating CSPs with global cardinality constraints using SDP hierarchies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Clustering causal relationships in genes expression data
WIRN'05 Proceedings of the 16th Italian conference on Neural Nets
Semidefinite clustering for image segmentation with a-priori knowledge
PR'05 Proceedings of the 27th DAGM conference on Pattern Recognition
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Distributed similarity estimation using derived dimensions
The VLDB Journal — The International Journal on Very Large Data Bases
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Machine learning with seriated graphs
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
On approximating complex quadratic optimization problems via semidefinite programming relaxations
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Sums of squares, satisfiability and maximum satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Semidefinite programming based approaches to home-away assignment problems in sports scheduling
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Graph seriation using semi-definite programming
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Approximating Linear Threshold Predicates
ACM Transactions on Computation Theory (TOCT)
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Using semi-definite programming to enhance supertree resolvability
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Stable bounded canonical sets and image matching
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Improved approximation algorithms for maximum graph partitioning problems extended abstract
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Novel scheduling algorithms for concurrent transmit/receive wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
The power of semidefinite programming relaxations for MAX-SAT
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximating maximum cut with limited unbalance
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
The capacitated max-k-cut problem
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Common deadline lazy bureaucrat scheduling revisited
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Random projection, margins, kernels, and feature-selection
SLSFS'05 Proceedings of the 2005 international conference on Subspace, Latent Structure and Feature Selection
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Semidefinite programming and approximation algorithms: a survey
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An exact solution method for unconstrained quadratic 0---1 programming: a geometric approach
Journal of Global Optimization
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Convergence and approximation in potential games
Theoretical Computer Science
Automatica (Journal of IFAC)
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A dichotomy for local small-bias generators
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Small bipartite subgraph polytopes
Operations Research Letters
Exact MAX-2SAT solution via lift-and-project closure
Operations Research Letters
High-multiplicity cyclic job shop scheduling
Operations Research Letters
A probabilistic result for the max-cut problem on random graphs
Operations Research Letters
On the Slater condition for the SDP relaxations of nonconvex sets
Operations Research Letters
A polynomial-time algorithm to find an equitable home-away assignment
Operations Research Letters
Shape-Based Object Detection via Boundary Structure Segmentation
International Journal of Computer Vision
On duality gap in binary quadratic programming
Journal of Global Optimization
Automatica (Journal of IFAC)
An SDP approach to multi-level crossing minimization
Journal of Experimental Algorithmics (JEA)
A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Journal of Combinatorial Optimization
A new discrete filled function method for solving large scale max-cut problems
Numerical Algorithms
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
SIAM Journal on Computing
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Who tags what?: an analysis framework
Proceedings of the VLDB Endowment
Identifying valuable customers on social networking sites for profit maximization
Expert Systems with Applications: An International Journal
Electronic Commerce Research and Applications
On quadratic programming with a ratio objective
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Optimal Pricing in Networks with Externalities
Operations Research
Gap inequalities for the max-cut problem: a cutting-plane algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Memetic search for the max-bisection problem
Computers and Operations Research
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
ACM Transactions on Mathematical Software (TOMS)
Canonical dual approach to solving the maximum cut problem
Journal of Global Optimization
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Random Structures & Algorithms
An invariance principle for polytopes
Journal of the ACM (JACM)
A memetic approach for the max-cut problem
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Approximate MRF inference using bounded treewidth subgraphs
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Fast near neighbor search in high-dimensional binary data
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
A spanning tree-based encoding of the MAX CUT problem for evolutionary search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Sign assignment problems on protein networks
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Vertex cover in graphs with locally few colors
Information and Computation
A characterization of approximation resistance for even k-partite CSPs
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Online constrained optimization with recourse
Information Processing Letters
On solving biquadratic optimization via semidefinite relaxation
Computational Optimization and Applications
A novel approach for leveraging co-occurrence to improve the false positive error in signature files
Journal of Discrete Algorithms
Approximation algorithm for a class of global optimization problems
Journal of Global Optimization
A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure
Information Sciences: an International Journal
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search
International Journal of Swarm Intelligence Research
Clustering under approximation stability
Journal of the ACM (JACM)
Hardness of approximation and integer programming frameworks for searching for caterpillar trees
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Max-k-Cut by the Discrete Dynamic Convexized Method
INFORMS Journal on Computing
A computational study and survey of methods for the single-row facility layout problem
Computational Optimization and Applications
Personalization in multimodal music retrieval
AMR'11 Proceedings of the 9th international conference on Adaptive Multimedia Retrieval: large-scale multimedia retrieval and evaluation
Hardness of approximation and integer programming frameworks for searching for caterpillar trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
Mathematics of Operations Research
Efficient rounding for the noncommutative grothendieck inequality
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Majority is stablest: discrete and SoS
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Semi-supervised learning using greedy max-cut
The Journal of Machine Learning Research
A Continuous Relaxation Method for Multiuser Detection Problem
Wireless Personal Communications: An International Journal
Cones of multipowers and combinatorial optimization problems
Computational Mathematics and Mathematical Physics
Explicit Optimal Hardness via Gaussian Stability Results
ACM Transactions on Computation Theory (TOCT)
Application of a MAX-CUT Heuristic to the Contig Orientation Problem in Genome Assembly
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
A homotopy method for nonlinear semidefinite programming
Computational Optimization and Applications
Solving large scale Max Cut problems via tabu search
Journal of Heuristics
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Correlation clustering with stochastic labellings
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
In-network approximate computation of outliers with quality guarantees
Information Systems
Exact Approaches to Multilevel Vertical Orderings
INFORMS Journal on Computing
SPARSI: partitioning sensitive data amongst multiple adversaries
Proceedings of the VLDB Endowment
Quantitative measurement and method for detecting anti-community structures in complex networks
International Journal of Wireless and Mobile Computing
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
Multireference alignment using semidefinite programming
Proceedings of the 5th conference on Innovations in theoretical computer science
Journal of Combinatorial Optimization
| Hi-index | 0.08 |