Algorithms for some graph theoretical optimization problems

ISSN： 1619-4500

Source： 4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol.4, Iss.3, 2006-09, pp. : 259-261

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Differential approximation algorithms for some combinatorial optimization problems

By Demange M. Grisoni P. Th. Paschos V.

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 107-122

Elsevier

Access to resources Recommend Favorite

Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

By Myoupo Jean-Frédéric Semé David

The Journal of Supercomputing, Vol. 38, Iss. 1, 2006-10 ,pp. : 83-107

Springer Publishing Company

Access to resources Recommend Favorite

Complexity and algorithms for nonlinear optimization problems

By Hochbaum Dorit

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 257-296

Springer Publishing Company

Access to resources Recommend Favorite

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

By Gramm Jens Guo Jiong Hüffner Falk Niedermeier Rolf

Algorithmica, Vol. 39, Iss. 4, 2004-05 ,pp. : 321-347

Springer Publishing Company

Access to resources Recommend Favorite

Models and algorithms for fair layout optimization problems

By Fernandes Muritiba Albert

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 5-14

Springer Publishing Company

Access to resources Recommend Favorite