2-Approximation algorithm for finding a clique with minimum weight of vertices and edges

By Eremin I.   Gimadi E.   Kel’manov A.   Pyatkin A.   Khachai M.  

Proceedings of the Steklov Institute of Mathematics, Vol. 284, Iss. 1, 2014-04 ,pp. : 87-95

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

By Nedev Z.P.   Wood P.T.  

Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. : 235-259

Academic Press

Access to resources Recommend Favorite

Finding shuffle words that represent optimal scheduling of shared memory access

By Reidenbach Daniel   Schmid Markus L.  

International Journal of Computer Mathematics, Vol. 90, Iss. 6, 2013-06 ,pp. : 1292-1309

Taylor & Francis Ltd

Access to resources Recommend Favorite

Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications

By Yao Yonghong  

Optimization, Vol. 60, Iss. 6, 2011-06 ,pp. : 645-658

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time

By Kolliopoulos S.G.   Stein C.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 125-141

Academic Press

Access to resources Recommend Favorite