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 Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence

By Cooper Colin   Radzik Tomasz   Siantos Yiannis  

Internet Mathematics, Vol. 10, Iss. 1-2, 2014-04 ,pp. : 137-161

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Efficient Algorithm for Polarizable Interactions: A Uniformly Distributed One-Dimensional Case

By Dinh Thuy-Linh   Huber Gary  

Journal of Mathematical Modelling and Algorithms, Vol. 4, Iss. 1, 2005-03 ,pp. : 111-128

Springer Publishing Company

Access to resources Recommend Favorite

Study on a Distributed Wavelength Routing Algorithm in WDM Optical Transport Networks

By Tian Xiangqing   Qi Xiaoqiong   Ma Qiongfang   Zhang Xiaoping  

Photonic Network Communications, Vol. 11, Iss. 3, 2006-05 ,pp. : 271-276

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Distributed Control Scheme for Lightpath Establishment in Dynamic WDM Networks

By Feng Feifei   Zheng Xiaoping   Zhang Hanyi   Guo Yili  

Photonic Network Communications, Vol. 7, Iss. 1, 2004-01 ,pp. : 5-15

Springer Publishing Company

Access to resources Recommend Favorite