Related content

Approximation and hardness results for label cut and related problems

By Zhang Peng   Cai Jin-Yi   Tang Lin-Qing   Zhao Wen-Bo  

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 192-208

Springer Publishing Company

Access to resources Recommend Favorite

Approximation hardness of edge dominating set problems

By Chlebík Miroslav   Chlebíková Janka  

Journal of Combinatorial Optimization, Vol. 11, Iss. 3, 2006-05 ,pp. : 279-290

Springer Publishing Company

Access to resources Recommend Favorite

An improved approximation ratio for the minimum latency problem

By Goemans M.   Kleinberg J.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 111-124

Elsevier

Access to resources Recommend Favorite

Global optimization method for solving the minimum maximal flow problem

By Gotoh Jun-Ya   Van Thoai Nguyen   Yamamoto Yoshitsugu  

Optimization Methods and Software, Vol. 18, Iss. 4, 2003-08 ,pp. : 395-415

Taylor & Francis Ltd

Access to resources Recommend Favorite

Hardness results and approximation algorithm for total liar’s domination in graphs

By Panda B.   Paul S.  

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 643-662

Springer Publishing Company

Access to resources Recommend Favorite