DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Maximum cut
Maximum cut
Lecture 20 — March 20, 2013 1 the Maximum Cut Problem 2 a Spectral
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable Csps?
Lecture 16: Constraint Satisfaction Problems 1 Max-Cut SDP
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds∗
Chicago Journal of Theoretical Computer Science the MIT Press
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable Csps?
Maximum Cut and Related Problems Approximating the Maximum
Streaming Algorithms for Maximum Satisfiability
Classification on the Computational Complexity of Spin Models
On the Mysteries of MAX NAE-SAT
Approximation Algorithms for Max Cut Outline Preliminaries Approximation Algorithm for Max Cut with Unit Weights Weighted Max Cut Inapproximability Results Definition
Pathwidth of Cubic Graphs and Exact Algorithms
Parameterized Algorithms for Maximum Cut With
VIII. Approximation Algorithms: MAX-CUT Problem (Outlook) Thomas Sauerwald
Hypergraph Cuts Above the Average
Minimum Stable Cut and Treewidth
NP-Completeness of Max-Cut for Segment Intersection Graphs
Top View
Connected Max Cut Is Polynomial for Graphs Without K5\E As a Minor
SDP Gaps and UGC-Hardness for Max-Cut-Gain∗
Parameterized Algorithms for Maximum Cut with Connectivity
Treewidth Theory and Applications to Computer Science
Some APX-Completeness Results for Cubic Graphs
Approximation Algorithm for Max Cut
2.1 the Max-Cut Problem
Lec. 3: MAXCUT and Introduction to Inapproximability Lecturer: Prahladh Harsha Scribe: Bodhayan Roy
Finding Almost-Perfect Graph Bisections
The Unique Games Conjecture and Some of Its Implications on Inapproximability
Bachelorthesisquincey
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
1 Randomized Approximation Algorithms
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Into 1 [Extended Abstract]
The Unique Games Conjecture with Entangled Provers Is False
On the Complexity of Unique Games and Graph Expansion
Online Maximum Directed Cut
Chapter 5: Random Sampling and Randomized Rounding of LP's