Related content

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

By Khani M.   Salavatipour Mohammad  

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 443-460

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Broadcasting and Gossiping

By Fraigniaud P.   Vial S.  

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 47-55

Academic Press

Access to resources Recommend Favorite

Approximation Algorithms for Scheduling with Reservations

By Diedrich Florian   Jansen Klaus   Pascual Fanny   Trystram Denis  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 391-404

Springer Publishing Company

Access to resources Recommend Favorite

Fractional Path Coloring in Bounded Degree Trees with Applications

By Caragiannis I.   Ferreira A.   Kaklamanis C.   Pérennes S.   Rivano H.  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 516-540

Springer Publishing Company

Access to resources Recommend Favorite

Sum Coloring of Bipartite Graphs with Bounded Degree

By Malafiejski Michal   Giaro Krzysztof   Janczewski Robert   Kubale Marek  

Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. : 235-244

Springer Publishing Company

Access to resources Recommend Favorite