Planar Maximum Box Problem

Author： Segal Michael  

Publisher： Springer Publishing Company

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.3, Iss.1, 2004-01, pp. : 31-38

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

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

Minimal Solutions to the Box Problem

By Chuang Jer-Chin (Luke)  

The College Mathematics Journal, Vol. 40, Iss. 5, 2009-11 ,pp. : 354-360

Mathematical Association of America

Access to resources Recommend Favorite

A “maximum node clustering” problem

By Carello Giuliana   Croce Federico   Grosso Andrea   Locatelli Marco  

Journal of Combinatorial Optimization, Vol. 11, Iss. 4, 2006-06 ,pp. : 373-385

Springer Publishing Company

Access to resources Recommend Favorite

Triangulating Planar Graphs While Minimizing the Maximum Degree

By Kant G.   Bodlaender H.L.  

Information and Computation, Vol. 135, Iss. 1, 1997-05 ,pp. : 1-14

Academic Press

Access to resources Recommend Favorite

Stochastic maximum weight forest problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 289-305

John Wiley & Sons Inc

Access to resources Recommend Favorite