On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.21, Iss.3, 1996-11, pp. : 579-597

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

Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 4, 2015-08 ,pp. : 282-299

John Wiley & Sons Inc

Access to resources Recommend Favorite

An efficient deterministic optimization approach for rectangular packing problems

By Tsai Jung-Fa

Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. : 989-1002

Taylor & Francis Ltd

Access to resources Recommend Favorite

Superconvergence of the local discontinuous Galerkin method for linear fourth-order time-dependent problems in one space dimension

By Meng Xiong Shu Chi-Wang Wu Boying

IMA Journal of Numerical Analysis, Vol. 32, Iss. 4, 2012-10 ,pp. : 1294-1328

Oxford University Press

Access to resources Recommend Favorite

Deterministic sorting in O(nloglogn) time and linear space

By Han Y.

Journal of Algorithms, Vol. 50, Iss. 1, 2004-01 ,pp. : 96-105

Elsevier

Access to resources Recommend Favorite

Linear-time algorithm for the matched-domination problem in cographs

By Hung Ruo-Wei Yao Chih-Chia

International Journal of Computer Mathematics, Vol. 88, Iss. 10, 2011-07 ,pp. : 2042-2056

Taylor & Francis Ltd

Access to resources Recommend Favorite