메뉴 건너뛰기




Volumn 31, Issue 1, 2002, Pages 39-45

On computational complexity of membership test in flow games and linear production games

Author keywords

Flow game; Linear production game; NP complete

Indexed keywords


EID: 0036745726     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001820200106     Document Type: Article
Times cited : (29)

References (13)
  • 1
    • 4243728521 scopus 로고
    • Technical Report SOCS-78.9, School of Computer Science, McGill University (Montreal)
    • Chvátal V. (1978) Rational behavior and computational complexity. Technical Report SOCS-78.9, School of Computer Science, McGill University (Montreal).
    • (1978) Rational behavior and computational complexity
    • Chvátal, V.1
  • 3
    • 0033358883 scopus 로고    scopus 로고
    • Algorithmic aspects of the core of combinatorial optimization games
    • Deng X., Ibaraki T., Nagamochi H. (1999) Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research 24:751-766.
    • (1999) Mathematics of Operations Research , vol.24 , pp. 751-766
    • Deng, X.1    Ibaraki, T.2    Nagamochi, H.3
  • 10
    • 0020182927 scopus 로고
    • Generalized network problems yielding totally balanced games
    • Kalai E., Zemel E. (1982b) Generalized network problems yielding totally balanced games. Operations Research 30:498 1008.
    • (1982) Operations Research , vol.30 , pp. 498-1008
    • Kalai, E.1    Zemel, E.2
  • 11
    • 0000928347 scopus 로고
    • Computational complexity and the game theory approach to cost allocation for a tree
    • Megiddo N. (1978) Computational complexity and the game theory approach to cost allocation for a tree. Mathematics of Operations Research 3:189-196.
    • (1978) Mathematics of Operations Research , vol.3 , pp. 189-196
    • Megiddo, N.1
  • 12
    • 0016594972 scopus 로고
    • On the core of linear production games
    • Owen G. (1975) On the core of linear production games. Mathematical Programming 9:358-370.
    • (1975) Mathematical Programming , vol.9 , pp. 358-370
    • Owen, G.1


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