Approximation algorithms for integer covering problems via greedy column generation
Y. Crama, J. Van De Klundert (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On-line computations of the ideal lattice of posets”
Approximation algorithms for integer covering problems via greedy column generation
On schemata and systems for parallel algorithms
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
An almost naive algorithm for finding relative neighbourhood graphs in metrics
Jyrki Katajainen, Olli Nevalainen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions
A. Aiello, E. Burattini, A. Massarotti (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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:
Combinatorial analysis of quicksort algorithm
P. Hennequin (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: