A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights

Author： Page Daniel R.   Solis-Oba Roberto  

Publisher： MDPI

E-ISSN： 1999-4893|9|2|38-38

ISSN： 1999-4893

Source： Algorithms, Vol.9, Iss.2, 2016-06, pp. : 38-38

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

Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach

By Isaacs Jason T.   Hespanha João P.  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 84-99

MDPI

Access to resources Recommend Favorite

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

By Király Zoltán  

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 471-484

MDPI

Access to resources Recommend Favorite

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

By Xu Shuhui   Wang Yong   Huang Aiqin  

Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. : 229-242

MDPI

Access to resources Recommend Favorite

An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem

By Lu Kong   Ting Li   Keming Wang   Hanbing Zhu   Makoto Takano   Bin Yu  

Algorithms, Vol. 8, Iss. 1, 2015-02 ,pp. : 19-31

MDPI

Access to resources Recommend Favorite

An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem †

By Kamei Sayaka   Kakugawa Hirotsugu  

Algorithms, Vol. 10, Iss. 2, 2017-03 ,pp. : 38-38

MDPI

Access to resources Recommend Favorite