Efficient Splitting and Merging Algorithms for Order Decomposable Problems

ISSN： 0890-5401

Source： Information and Computation, Vol.154, Iss.1, 1999-10, pp. : 1-33

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

Splitting methods for second-order initial value problems

By van der Houwen P.J. Messina E.

Numerical Algorithms, Vol. 18, Iss. 3-4, 1998-01 ,pp. : 233-257

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

By Berman P. DasGupta B. Muthukrishnan S. Ramaswami S.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 443-470

Elsevier

Access to resources Recommend Favorite

Efficient Merging and Construction of Evolutionary Trees

By Lingas A. Olsson H. Östlin A.

Journal of Algorithms, Vol. 41, Iss. 1, 2001-10 ,pp. : 41-51

Academic Press

Access to resources Recommend Favorite

Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting

By Wasilkowski G. Woźniakowski H.

Foundations of Computational Mathematics, Vol. 9, Iss. 1, 2009-02 ,pp. : 105-132

Springer Publishing Company

Access to resources Recommend Favorite

On the Convergence of Cone Splitting Algorithms with &ohgr;-Subdivisions

By Jaumard B. Meyer C.

Journal of Optimization Theory and Applications, Vol. 110, Iss. 1, 2001-07 ,pp. : 119-144

Springer Publishing Company

Access to resources Recommend Favorite