메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 65, Issue 1-3, 1996, Pages 191-206
On some multicriteria arborescence problems: Complexity and algorithms
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0041875742     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00035-P     Document Type: Article
Times cited : (7)
References (13)
  • 1
    • 0002741637 scopus 로고
    • The min-max spanning tree problem and some extensions, Inform. Process
    • P.M. Camerini, The min-max spanning tree problem and some extensions, Inform. Process. Lett. 7 (1978) 10-14.
    • (1978) Lett. , vol.7 , pp. 10-14
    • Camerini, P.M.1
  • 3
    • 0019346357 scopus 로고
    • On the complexity of finding multi-constrained spanning trees
    • P.M. Camerini, G. Galbiati and F. Maffioli, On the complexity of finding multi-constrained spanning trees. Discrete Appl. Math. 5 (1983) 39-50.
    • (1983) Discrete Appl. Math. , vol.5 , pp. 39-50
    • Camerini, P.M.1    Galbiati, G.2    Maffioli, F.3
  • 4
    • 0002240855 scopus 로고
    • The complexity of weighted multi-constrained spanning tree problems
    • Lovász and Szemerédi, eds., Colloquia Mathematica Societatis Járos Bolyai North-Holland, Amsterdam
    • P.M. Camerini, G. Galbiati and F. Maffioli, The complexity of weighted multi-constrained spanning tree problems, in: Lovász and Szemerédi, eds., Theory of Algorithms, Colloquia Mathematica Societatis Járos Bolyai 44 (North-Holland, Amsterdam, 1985) 53-102.
    • (1985) Theory of Algorithms , vol.44 , pp. 53-102
    • Camerini, P.M.1    Galbiati, G.2    Maffioli, F.3
  • 5
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269-271.
    • (1959) Numer. Math. , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 6
    • 0001228487 scopus 로고
    • Optimum branchings
    • J. Edmonds, Optimum branchings, J. Res. NBS 71B (1967) 233-240.
    • (1967) J. Res. NBS , vol.71 B , pp. 233-240
    • Edmonds, J.1
  • 8
    • 0342800860 scopus 로고
    • The NP-completeness column: An ongoing guide
    • D.S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 6 (1985) 145-159.
    • (1985) J. Algorithms , vol.6 , pp. 145-159
    • Johnson, D.S.1
  • 9
    • 0018767509 scopus 로고
    • A note on finding optimum branchings
    • F. Maffioli, L. Fratta and P.M. Camerini, A note on finding optimum branchings, Networks 9 (1979) 309-312.
    • (1979) Networks , vol.9 , pp. 309-312
    • Maffioli, F.1    Fratta, L.2    Camerini, P.M.3
  • 10
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R.C. Prim, Shortest connection networks and some generalizations, Bell System Tech. J. 36 (1957) 1389-1401.
    • (1957) Bell System Tech. J. , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 11
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • R.E. Tarjan, Finding optimum branchings, Networks 7 (1977) 25-35.
    • (1977) Networks , vol.7 , pp. 25-35
    • Tarjan, R.E.1
  • 12
    • 0042264652 scopus 로고
    • private communication
    • P. Toth, private communication, 1978.
    • (1978)
    • Toth, P.1
  • 13
    • 77957053582 scopus 로고
    • Multiple criteria decision making: Five basic concepts
    • Elsevier, Amsterdam
    • P.L. Yu, Multiple criteria decision making: five basic concepts, in: Handbook of Operations Research Vol. 1 (Elsevier, Amsterdam, 1989) 663-699.
    • (1989) Handbook of Operations Research , vol.1 , pp. 663-699
    • Yu, P.L.1

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