Approximating the Minimum Tour Cover of a Digraph

Author： Nguyen Viet Hung  

Publisher： MDPI

E-ISSN： 1999-4893|4|1|75-86

ISSN： 1999-4893

Source： Algorithms, Vol.4, Iss.1, 2011-04, pp. : 75-86

Access to resources Favorite

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

Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window

By Ting Hing-Fung   Lee Lap-Kei   Chan Ho-Leung   Lam Tak-Wah  

Algorithms, Vol. 4, Iss. 3, 2011-09 ,pp. : 200-222

MDPI

Access to resources Recommend Favorite

Numerical Properties of Different Root-Finding Algorithms Obtained for Approximating Continuous Newton’s Method

By Gutiérrez José M.  

Algorithms, Vol. 8, Iss. 4, 2015-12 ,pp. : 1210-1218

MDPI

Access to resources Recommend Favorite

The Minimum Scheduling Time for Convergecast in Wireless Sensor Networks

By Jung(Andrew) Changyong   Lee Suk Jin   Bhuse Vijay  

Algorithms, Vol. 7, Iss. 1, 2014-03 ,pp. : 145-165

MDPI

Access to resources Recommend Favorite

A New Multi-Step Iterative Algorithm for Approximating Common Fixed Points of a Finite Family of Multi-Valued Bregman Relatively Nonexpansive Mappings

By Kumam Wiyada   Sunthrayuth Pongsakorn   Phunchongharn Phond   Akkarajitsakul Khajonpong   Ngiamsunthorn Parinya Sa   Kumam Poom  

Algorithms, Vol. 9, Iss. 2, 2016-05 ,pp. : 37-37

MDPI

Access to resources Recommend Favorite

An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem

By Catanzaro Daniele   Engelbeen Céline  

Algorithms, Vol. 8, Iss. 4, 2015-11 ,pp. : 999-1020

MDPI

Access to resources Recommend Favorite