Last update: Thu Jun 20 02:01:00 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Figueiredo:2006:MIR,
author = "Gustavo B. Figueiredo and Nelson L. S. da Fonseca and
Jos{\'e} A. S. Monteiro",
title = "A minimum interference routing algorithm with reduced
computational complexity",
journal = j-COMP-NET-AMSTERDAM,
volume = "50",
number = "11",
pages = "1710--1732",
day = "10",
month = aug,
year = "2006",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:12 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
Related entries
- algorithm,
33(1)449,
34(2)279,
34(3)341,
34(3)481,
35(2)287,
36(2)251,
37(3)331,
37(5)631,
38(3)311,
38(4)447,
38(6)765,
39(4)363,
39(4)457,
39(5)681,
39(6)729,
41(1)41,
41(2)227,
41(4)363,
41(6)727,
42(4)503,
42(6)697,
43(3)247,
43(5)669,
44(1)17,
44(1)43,
45(2)155,
45(6)731,
46(4)505,
47(1)87,
47(4)525,
47(6)785,
48(2)155,
48(2)215,
48(6)972,
49(2)201,
49(2)243,
49(4)476,
49(4)593,
50(2)207,
50(3)422,
50(8)1086,
50(8)1176,
50(9)1384,
50(11)1816,
50(13)2239,
50(13)2286,
50(15)2713,
50(15)2805,
50(16)2981,
50(17)3225,
50(17)3375,
51(1)69,
51(4)1031,
51(6)1499,
51(6)1705,
51(8)1998,
51(8)2104,
51(9)2223,
51(11)3110,
51(11)3172,
51(11)3252,
51(13)3919,
51(14)3989,
51(15)4270,
51(16)4669,
52(3)531,
52(3)542,
52(5)1093,
52(6)1238,
52(7)1492,
52(9)1675,
52(10)1905,
52(13)2473,
52(13)2543,
52(15)2819,
52(15)2894,
52(16)3130,
52(17)3229,
53(1)25,
53(1)110,
53(3)247,
53(7)926,
53(7)945,
53(9)1480,
53(13)2275,
53(14)2458,
53(14)2537,
53(18)2997
- complexity,
53(12)2241
- Fonseca, Nelson L. S. da,
40(3)413,
48(3)289,
48(3)351,
52(9)1762,
53(11)1859
- interference,
46(6)867,
51(12)3338,
52(6)1252,
52(14)2728,
53(1)25,
53(2)141,
53(5)569
- minimum,
45(6)801,
47(4)489,
52(3)493,
52(17)3229,
53(10)1649