메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 70-74

Maximum weighted matching with interference constraints

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMUM WEIGHTED MATCHING PROBLEMS(MWMP); MULTI-HOP WIRELESS SYSTEMS; POLYNOMIAL TIME;

EID: 33747304620     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PERCOMW.2006.79     Document Type: Conference Paper
Times cited : (47)

References (11)
  • 1
    • 4244129699 scopus 로고
    • A distributed algorithm for scheduling the activation of links in a self-organizing mobile radio network
    • D. J. Baker, J. Wieselthier, and A. Ephremides. A Distributed Algorithm for Scheduling the Activation of Links in a Self-organizing Mobile Radio Network. In IEEE ICC, pages 2F.6.1-2F.6.5, 1982.
    • (1982) IEEE ICC
    • Baker, D.J.1    Wieselthier, J.2    Ephremides, A.3
  • 3
    • 33746651061 scopus 로고    scopus 로고
    • Throughput guarantees through maximal scheduling in wireless networks
    • Dept. of EE, Univ. of Pennsylvania
    • P. Chaporkar, K. Kar, and S. Sarkar. Throughput Guarantees Through Maximal Scheduling in Wireless Networks. Technical Report, Dept. of EE, Univ. of Pennsylvania, 2005.
    • (2005) Technical Report
    • Chaporkar, P.1    Kar, K.2    Sarkar, S.3
  • 4
    • 25844473276 scopus 로고    scopus 로고
    • Joint congestion control and media access control design for wireless ad hoc networks
    • Mar
    • L. Chen, S. H. Low, and J. C. Doyle. Joint congestion control and media access control design for wireless ad hoc networks. In IEEE INFOCOM, Mar 2005.
    • (2005) IEEE INFOCOM
    • Chen, L.1    Low, S.H.2    Doyle, J.C.3
  • 5
    • 85030568489 scopus 로고
    • Data structures for weighted matching and nearest common ancestors with linking
    • H. N. Gabow. Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In SODA, 1990.
    • (1990) SODA
    • Gabow, H.N.1
  • 6
    • 0000595574 scopus 로고
    • Computational complexity of probabilistic turing machines
    • J. Gill. Computational Complexity of Probabilistic Turing Machines. SIAM Journal on Computing, 6(4):675-695, 1977.
    • (1977) SIAM Journal on Computing , vol.6 , Issue.4 , pp. 675-695
    • Gill, J.1
  • 8
    • 25844499235 scopus 로고    scopus 로고
    • The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks
    • Mar
    • X. Lin and N. B. Shroff. The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks. In IEEE INFOCOM, Mar 2005.
    • (2005) IEEE INFOCOM
    • Lin, X.1    Shroff, N.B.2
  • 10
    • 33750373562 scopus 로고    scopus 로고
    • On the complexity of scheduling in multi-hop wireless systems
    • School of ECE, Purdue University
    • G. Sharma, R. R. Mazumdar, and N. B. Shroff. On the Complexity of Scheduling in Multi-hop Wireless Systems. Technical Report, School of ECE, Purdue University, 2005.
    • (2005) Technical Report
    • Sharma, G.1    Mazumdar, R.R.2    Shroff, N.B.3


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