Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?

doi 10.1109/focs.2004.49
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?

SIAM Journal on Computing
MathematicsComputer Science
2007English

Optimization and Optimality Test for the Max-Cut Problem

Mathematical Methods of Operations Research
Management ScienceSoftwareOperations ResearchMathematics
1990English

Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2009English

Max Cut for Random Graphs With a Planted Partition

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2004English

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2006English

Partitioning Planar Graphs: A Fast Combinatorial Approach for Max-Cut

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2010English

Improving the Smoothed Complexity of FLIP for Max Cut Problems

2019English

Certain Results for the 2-Variable Peters Mixed Type and Related Polynomials

Analysis in Theory and Applications
2018English

Approximate Max K-Cut With Subgraph Guarantee

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy