Algorithms and time complexity of the request-service problem

Author： Liu Chunmei   Burge Legand   Blake Ajoni  

Publisher： Springer Publishing Company

ISSN： 1382-6905

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

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

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

By Qiu Jiaming   Sharkey Thomas  

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

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of a problem of energy efficient real‐time task scheduling on a multicore processor

By  

COMPLEXITY (ELECTRONIC), Vol. 21, Iss. 1, 2015-09 ,pp. : 259-267

John Wiley & Sons Inc

Access to resources Recommend Favorite

Complexity of a problem of energy efficient real‐time task scheduling on a multicore processor

By  

COMPLEXITY (ELECTRONIC), Vol. 1076-2787, Iss. 1, 2015-09 ,pp. : 259-267

John Wiley & Sons Inc

Access to resources Recommend Favorite

Reasoning with BKBs – Algorithms and Complexity

By Rosen Tzachi  

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

Springer Publishing Company

Access to resources Recommend Favorite

Nonmonotonic reasoning: from complexity to algorithms

By Cayrol C.  

Annals of Mathematics and Artificial Intelligence, Vol. 22, Iss. 3-4, 1998-01 ,pp. : 207-236

Springer Publishing Company

Access to resources Recommend Favorite