LINK SCHEDULING IN POLYNOMIAL-TIME

被引：318

作者：

HAJEK, B ^{[1
]}

SASAKI, G ^{[1
]}

机构：

[1] UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1988年 / 34卷 / 05期

关键词：

Conversations - Link Scheduling - Polynomial Time - Spread Spectrum Radio Network;

D O I：

10.1109/18.21215

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：910 / 917

页数：8

共 19 条

[1] SOME COMPLEXITY RESULTS ABOUT PACKET RADIO NETWORKS [J].

ARIKAN, E .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (04) :681-685

[2]

BAKER DJ, 1982, JUN IEEE INT C COMM

[3]

Berge C., 1976, GRAPHS HYPERGRAPHS

[4]

COFFMAN EG, IN PRESS SIAM J COMP

[5] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[6]

Fiorini S, 1977, EDGE COLOURINGS GRAP

[7] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .

COMBINATORICA, 1981, 1 (02) :169-197

[8] OPTIMAL DYNAMIC ROUTING IN COMMUNICATION-NETWORKS WITH CONTINUOUS TRAFFIC [J].

HAJEK, B ;

OGIER, RG .

NETWORKS, 1984, 14 (03) :457-487

[9]

HAJEK B, 1984, 1984 P C INF SCI SYS, P498

[10]

Hoyler I., 1981, SIAM J COMPUT, V10, P718

← 1 2 →