A Class of Inverse Dominant Problems under Weighted l_∞ Norm and an Improved Complexity Bound for Radzik’s Algorithm

Author： Wang Qin Yang Xiaoguang Zhang Jianzhong

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.34, Iss.4, 2006-04, pp. : 551-567

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

Robust polynomial classifier using L ¹-norm minimization

By Assaleh K. Shanableh T.

Applied Intelligence, Vol. 33, Iss. 3, 2010-12 ,pp. : 330-339

Springer Publishing Company

Access to resources Recommend Favorite

A Linear Time Algorithm for L(2,1)-Labeling of Trees

By Hasunuma Toru Ishii Toshimasa Ono Hirotaka Uno Yushi

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 654-681

Springer Publishing Company

Access to resources Recommend Favorite

On the (Non-)Existence of Polynomial Kernels for P _l-Free Edge Modification Problems

By Guillemot Sylvain Havet Frédéric Paul Christophe Perez Anthony

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 900-926

Springer Publishing Company

Access to resources Recommend Favorite

Robust D-decomposition under l _p-bounded parametric uncertainties

By Tremba A.

Automation and Remote Control, Vol. 67, Iss. 12, 2006-12 ,pp. : 1878-1892

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l _∞-Fitting Robinson Structures to Distances

By Chepoi Victor Seston Morgan

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 521-568

Springer Publishing Company

Access to resources Recommend Favorite