Hardness results for multicast cost sharing

Author： Feigenbaum J. Krishnamurthy A. Sami R. Shenker S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 215-236

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

Competitive Cost Sharing with Economies of Scale

By Hoefer Martin

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 743-765

Springer Publishing Company

Access to resources Recommend Favorite

Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks

By Alrabiah T. Znati T.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 9, 2001-09 ,pp. : 1307-1336

Academic Press

Access to resources Recommend Favorite

Hardness results for neural network approximation problems

By Bartlett P.L. Ben-David S.

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 53-66

Elsevier

Access to resources Recommend Favorite

General aggregation of demandand cost sharing methods

By Tijs S. Koster M.

Annals of Operations Research, Vol. 84, Iss. 1, 1998-01 ,pp. : 137-164

Springer Publishing Company

Access to resources Recommend Favorite

Cost benefit sharing-based coordination in logistics networks

By Riha Iwo V. Radermacher Bernd

International Journal of Information Technology and Management, Vol. 8, Iss. 2, 2009-02 ,pp. : 161-177

Inderscience Publishers

Access to resources Recommend Favorite