메뉴 건너뛰기




Volumn , Issue , 2001, Pages 364-372

Applications of approximation algorithms to cooperative games

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LINEAR PROGRAMMING; MULTICASTING; PACKET NETWORKS; ROUTERS;

EID: 0034825997     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380825     Document Type: Conference Paper
Times cited : (146)

References (32)
  • 2
    • 84981618294 scopus 로고
    • On cost allocation for a spanning tree: A game theoretic approach
    • (1976) Networks , vol.6 , pp. 335-350
    • Bird, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.