Related content

A simulated annealing algorithm for the maximum planar subgraph problem

By Poranen T.  

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 555-568

Taylor & Francis Ltd

Access to resources Recommend Favorite

Tight Bounds for the Maximum Acyclic Subgraph Problem

By Berger B.   Shor P.W.  

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 1-18

Academic Press

Access to resources Recommend Favorite

Phased local search for the maximum clique problem

By Pullan Wayne  

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 303-323

Springer Publishing Company

Access to resources Recommend Favorite

New approximations for Maximum Lifetime Coverage

By Willson James   Wu Weili   Wu Lidong   Ding Ling   Du Ding-Zhu  

Optimization, Vol. 63, Iss. 6, 2014-06 ,pp. : 839-847

Taylor & Francis Ltd

Access to resources Recommend Favorite

Hardness of k-Vertex-Connected Subgraph Augmentation Problem

By Ma Changcun   Kim Donghyun   Wang Yuexuan   Wang Wei   Sohaee Nassim   Wu Weili  

Journal of Combinatorial Optimization, Vol. 20, Iss. 3, 2010-10 ,pp. : 249-258

Springer Publishing Company

Access to resources Recommend Favorite