SCOPUS 정보 검색 플랫폼

Wireless Networks

Volumn 7, Issue 6, 2001, Pages 575-584

Models and approximation algorithms for channel assignment in radio networks

(3) Krumke, Sven O a Marathe, Madhav V b Ravi, S S c

a ZUSE INSTITUTE BERLIN (Germany)

b LOS ALAMOS NATIONAL LABORATORY (United States)

c State University of New York (United States)

Author keywords

Approximation algorithms; Channel assignment; Geometric graphs; Radio networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; GRAPH THEORY; PACKET NETWORKS; RADIO COMMUNICATION;

CHANNEL ASSIGNMENT;

CHANNEL CAPACITY;

EID: 0035506896 PISSN: 10220038 EISSN: None Source Type: Journal
DOI: 10.1023/A:1012311216333 Document Type: Article

Times cited : (131)

References (33)

1
- 0002235763
- Coloring powers of planar graphs
- San Francisco, CA (January)
- (2000) Proc. Eleventh Annual ACM-SIAM Symposium on Algorithms (SODA'2000) , pp. 654-662
- Agnarsson, G.¹ Halldórsson, M.²

2
- 0021787868
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability
- (1985) BIT , vol.25 , pp. 2-23
- Arnborg, S.¹

3
- 0000504885
- Easy problems for tree-decomposable graphs
- (1991) J. Algorithms , vol.12 , pp. 308-340
- Arnborg, S.¹ Lagergren, J.² Seese, D.³

4
- 0002003951
- Linear-time algorithms for NP-hard problems on graphs embedded in k-trees
- (1989) Discrete Applied Math. , vol.23 , pp. 11-24
- Arnborg, S.¹ Proskurowski, A.²

5
- 0028255806
- Approximation algorithms for NP-complete problems on planar graphs
- (1994) J. ACM , vol.41 , pp. 308-340
- Baker, B.S.¹

6
- 0000964917
- Dynamic programming on graphs of bounded treewidth
- Proc. 15th International Colloquium on Automata Languages and Programming (ICALP'88)
- (1988) Lecture Notes in Computer Science , vol.317 , pp. 105-118
- Bodlaender, H.L.¹

7
- 0006740793
- Technical report RUU-CS-88-14, Department of Computer Science, University of Utrecht, The Netherlands (March)
- (1988) Planar graphs with bounded treewidth
- Bodlaender, H.L.¹

8
- 0000839639
- Unit disk graphs
- (1990) Discrete Math. , vol.86 , pp. 165-177
- Clark, B.N.¹ Colbourn, C.J.² Johnson, D.S.³

9
- 0003831025
- The Carus Mathematical Monographs (The Mathematical Association of America, Providence, RI)
- (1984) Random Walks and Electric Networks
- Doyle, P.G.¹ Snell, J.L.²

10
- 0001388944
- On coloring unit disk graphs
- (1998) Algorithmica , vol.20 , pp. 277-293
- Gräf, A.¹ Stumpf, M.² Weißenfels, G.³

11
- 0028251790
- Moments of inertia and graph separators
- Arlington, VA (January)
- (1994) Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94) , pp. 452-461
- Greenbaum, K.¹ Miller, G.L.² Teng, S.H.³

12
- 4243883953
- Report No. LSE-CDAM-99-06, Center for Discrete and Applicable Mathematics, London School of Economics, London, UK (June)
- (1999) Coloring the square of a planar graph
- Van den Huevel, J.¹ McGuinness, S.²

13
- 0000091588
- NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
- (1998) J. Algorithms , vol.26 , pp. 238-274
- Hunt III, H.B.¹ Marathe, M.V.² Radhakrishnan, V.³ Ravi, S.S.⁴ Rosenkrantz, D.J.⁵ Stearns, R.E.⁶

14
- 0028255537
- Coloring inductive graphs on-line
- (1994) Algorithmica , vol.11 , pp. 53-72
- Irani, S.¹

15
- 84957610071
- An approximation scheme for bin packing with conflicts
- Proc. Scandinavian Workshop on Algorithmic Theory (SWAT'98), Stockholm, Sweden, (Springer-Verlag, July)
- (1998) Lecture Notes in Computer Science , vol.1432 , pp. 35-46
- Jansen, K.¹

16
- 9644299374
- The NP-completeness column: An ongoing guide
- (1982) J. Algorithms , vol.3 , pp. 184
- Johnson, D.S.¹

17
- 0006659352
- Personal communication (March 1999)
- Ma, X.¹ Lloyd, E.L.²

18
- 85025286367
- Simple heuristics for unit disk graphs
- (1995) Networks , vol.25 , pp. 59-68
- Marathe, M.V.¹ Breu, H.² Hunt III, H.B.³ Ravi, S.S.⁴ Rosenkrantz, D.J.⁵

19
- 0020765471
- Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem
- (1983) Math. Programming , vol.26 , pp. 153-171
- McCormick, S.T.¹

20
- 0030703027
- Separators for sphere packings and nearest neighbor graphs
- (1997) J. ACM , vol.44 , pp. 1-29
- Miller, G.L.¹ Teng, S.H.² Thurston, W.³ Vavasis, S.A.⁴

21
- 0026391008
- A unified geometric approach to graph separators
- Puerto Rico (October)
- (1991) Proc. 32nd IEEE Symposium on Foundations of Computer Science (FOCS'91) , pp. 538-547
- Miller, G.L.¹ Teng, S.H.² Vavasis, S.A.³

22
- 0006731058
- Efficient vertex and edge coloring of outerplanar graphs
- (1986) SIAM J. Algebraic and Discrete Methods , vol.7 , pp. 131-136
- Proskurowski, A.¹ Syslo, M.M.²

23
- 0003795965
- Ph.D. Thesis, Department of Computer Science, University of Delaware, Newark
- (1993) Scheduling algorithms for multi-hop radio networks
- Ramanathan, S.¹

24
- 0031336888
- A unified framework and algorithm for (T/F/C) DMA channel assignment in wireless networks
- Kobe, Japan (April)
- (1997) Proc. IEEE INFOCOM'97
- Ramanathan, S.¹

25
- 0027574594
- Scheduling algorithms for multi-hop radio networks
- (1993) IEEE/ACM Transactions on Networking , vol.1 , pp. 166-172
- Ramanathan, S.¹ Lloyd, E.L.²

26
- 4244023092
- Graph minors
- Preprint
- (1992) Wagner's conjecture , vol.14
- Robertson, N.¹ Seymour, P.²

27
- 0030679903
- A new model for scheduling packet radio networks
- (1997) Wireless Networks , vol.3 , pp. 71-82
- Sen, A.¹ Huson, M.L.²

28
- 24244457050
- Technical report 96-008, Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
- (1996) On approximation algorithms for radio network scheduling
- Sen, A.¹ Malesinska, E.²

29
- 0030381960
- Spectral partitioning works: Planar graphs and finite element meshes
- Burlington, VT (October)
- (1996) 37th Annual Symposium on Foundations of Computer Science (FOCS'96) , pp. 96-105
- Spielman, D.¹ Teng, S.H.²

30
- 0003974833
- Points, spheres, and separators
- Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, CMU-CS-91-184, Pittsburgh (August)
- (1991) A unified geometric approach to graph separators
- Teng, S.H.¹

31
- 0000334511
- Automatic domain partitioning in three dimensions
- (1991) SIAM J. Sci. Stat. Comp. , vol.12 , pp. 950-970
- Vavasis, S.A.¹

32
- 0003736074
- Longman Publishers, Bungay, UK
- (1979) Introduction to Graph Theory, 2nd edition
- Wilson, R.J.¹

33
- 0033722049
- Generalized vertex colorings of partial k-trees
- April
- (2000) IEICE Transaction Fundamentals , vol.E-A , Issue.4 , pp. 1-8
- Zhou, X.¹ Kanari, Y.² Nishizeki, T.³

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