Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems

Author： Bergantiños Gustavo   Lorenzo Leticia  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.137, Iss.1, 2005-07, pp. : 101-115

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

The Stackelberg Minimum Spanning Tree Game

By Cardinal Jean   Demaine Erik   Fiorini Samuel   Joret Gwenaël   Langerman Stefan   Newman Ilan   Weimann Oren  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 129-144

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher   Palocsay Susan  

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite

On the approximability of some Maximum Spanning Tree Problems

By Galbiati G.   Morzenti A.   Maffioli F.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 107-118

Elsevier

Access to resources Recommend Favorite

Approximation Algorithms for Quickest Spanning Tree Problems

By Hassin Refael   Levin Asaf  

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 43-52

Springer Publishing Company

Access to resources Recommend Favorite

Parallel approximation algorithms for minimum routing cost spanning tree

By Chen Kun   Hsieh Yung En   Lu Ping Jung  

International Journal of Computational Science and Engineering, Vol. 8, Iss. 4, 2013-10 ,pp. : 336-348

Inderscience Publishers

Access to resources Recommend Favorite