On the distributed decision-making complexity of the minimum vertex cover problem
Pierluigi Crescenzi, Luca Trevisan (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Analysis of a class of graph partitioning problems”
On the distributed decision-making complexity of the minimum vertex cover problem
An approach to parallel algorithm design
G. Georgakopoulos, A. Stafylopatis (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Lower bounds to the graph partitioning problem through generalized linear programming and network flows
M. Minoux, E. Pinson (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The disjoint cliques problem
Klaus Jansen, Petra Scheffler, Gerhard Woeginger (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Improved lower bounds to the travelling salesman problem
Gianfranco d'Atri (1978)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A factor-two approximation algorithm for two-dimensional phase unwrapping.
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
Towards a general principle of evaluation for approximate algorithms
A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A dual feasible forest algorithm for the linear assignment problem
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: