Constant factor approximation algorithms for coalition structure generation

ISSN： 1387-2532

Source： Autonomous Agents and Multi-Agent Systems, Vol.23, Iss.1, 2011-07, pp. : 1-17

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

Anytime coalition structure generation: an average case study

By Larson Kate S. Sandholm Tuomas W.

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 12, Iss. 1, 2000-01 ,pp. : 23-42

Taylor & Francis Ltd

Access to resources Recommend Favorite

A framework for statistical clustering with constant time approximation algorithms for K -median and K -means clustering

By Ben-David Shai

Machine Learning, Vol. 66, Iss. 2-3, 2007-03 ,pp. : 243-257

Springer Publishing Company

Access to resources Recommend Favorite

A constant-factor approximation for d-hop connected dominating sets in unit disk graph

By Gao Xiaofeng Wu Weili Zhang Xuefei Li Xianyue

International Journal of Sensor Networks, Vol. 12, Iss. 3, 2012-11 ,pp. : 125-136

Inderscience Publishers

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