A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

ISSN： 1862-4472

Source： Optimization Letters, Vol.8, Iss.4, 2014-04, pp. : 1201-1212

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

Related content

Approximation Algorithms for Time Constrained Scheduling

By Jansen K. Ohring S.

Information and Computation, Vol. 132, Iss. 2, 1997-02 ,pp. : 85-108

Academic Press

Access to resources Recommend Favorite

Approximation Algorithms for the Class Cover Problem

By Cannon Adam H.

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 215-223

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for the stochastic priority facility location problem

By Li Gaidi Wang Zhen Wu Chenchen

Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. : 919-928

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact and approximation algorithms for a soft rectangle packing problem

By Fügenschuh Armin Junosza-Szaniawski Konstanty Lonc Zbigniew

Optimization, Vol. 63, Iss. 11, 2014-11 ,pp. : 1637-1663

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms and time complexity of the request-service problem

By Liu Chunmei Burge Legand Blake Ajoni

Journal of Combinatorial Optimization, Vol. 20, Iss. 2, 2010-08 ,pp. : 180-193

Springer Publishing Company

Access to resources Recommend Favorite