Publication:4252727
From MaRDI portal
zbMath0938.68820MaRDI QIDQ4252727
Mihir Bellare, Oded Goldreich, Madhu Sudan
Publication date: 26 April 2000
Related Items
Social network coordination and graph routing, Pseudo-Boolean optimization, Alphabet indexing for approximating features of symbols, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, Approximability of maximum splitting of k-sets and some other Apx-complete problems, On approximation algorithms for the minimum satisfiability problem, Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function, The complexity of the \(T\)-coloring problem for graphs with small degree, Some APX-completeness results for cubic graphs, Extended capabilities for visual cryptography, Annealed replication: A new heuristic for the maximum clique problem, Max NP-completeness made easy, Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP, On the hardness of approximating the minimum consistent acyclic DFA and decision diagram., Extended and discretized formulations for the maximum clique problem