Related content

Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm

By Kuntz Pascale   Pinaud Bruno   Lehn Rémi  

Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. : 23-36

Springer Publishing Company

Access to resources Recommend Favorite

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

By Guruswami V.   Khanna S.   Rajaraman R.   Shepherd B.   Yannakakis M.  

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 473-496

Elsevier

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

Algorithms for Minimizing Response Time in Broadcast Scheduling

By Gandhi Rajiv   Khuller Samir   Kim Yoo-Ah   Wan Yung-Chun (Justin)  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 597-608

Springer Publishing Company

Access to resources Recommend Favorite