Selected papers from the second Krakow conference on Graph theory
On Syntactic versus Computational Views of Approximability
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Dynamics in network interaction games
DISC'09 Proceedings of the 23rd international conference on Distributed computing
| Hi-index | 0.00 |
This note confirms a conjecture of (Bramoullé in Games Econ Behav 58:30---49, 2007). The problem, which we name the maximum independent cut problem, is a restricted version of the MAX-CUT problem, requiring one side of the cut to be an independent set. We show that the maximum independent cut problem does not admit any polynomial time algorithm with approximation ratio better than n 1驴∈ , where n is the number of nodes, and ∈ arbitrarily small, unless $\mathrm{P} = \mathrm{NP}$ . For the rather special case where each node has a degree of at most four, the problem is still APX-hard.