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{Korkmaz:2001:RAF,
author = "Turgay Korkmaz and Marwan Krunz",
title = "A randomized algorithm for finding a path subject to
multiple {QoS} requirements",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "2--3",
pages = "251--268",
day = "??",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib",
URL = "http://www.elsevier.nl/gej%2Dng/10/15/22/61/27/33/abstract.html;
http://www.elsevier.nl/gej%2Dng/10/15/22/61/27/33/article.pdf",
acknowledgement = ack-nhfb,
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,
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)1710,
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
- finding,
52(15)2831,
53(9)1431
- Korkmaz, Turgay,
46(2)273,
50(13)2349,
50(18)3743,
51(14)4153
- Krunz, Marwan,
40(3)445,
43(2)211,
46(2)273,
50(13)2349,
51(8)2163,
51(10)2854,
51(13)3673,
53(9)1395
- multiple,
32(5)653,
37(3)383,
39(2)151,
41(4)407,
43(6)787,
46(1)3,
46(1)41,
47(5)725,
50(8)1145,
50(16)2937,
51(11)3125,
51(14)3978,
52(16)3101,
53(1)110,
53(3)322,
53(5)596,
53(5)691,
53(6)864,
53(12)2208
- path,
32(1)99,
32(5)653,
33(1)377,
38(3)373,
38(5)663,
39(2)165,
40(1)149,
40(3)399,
43(5)557,
44(1)79,
46(2)197,
47(3)307,
48(6)960,
50(3)398,
50(10)1474,
50(12)1887,
50(13)2349,
51(3)835,
51(7)1815,
51(10)2467,
51(10)2738,
51(11)3278,
51(12)3574,
51(14)4189,
52(6)1166,
52(12)2360,
52(12)2411,
52(15)2975,
53(7)1014,
53(9)1341,
53(9)1467,
53(9)1530,
53(10)1697
- QoS,
35(1)57,
35(2)307,
36(2)137,
36(2)357,
37(1)45,
37(3)263,
37(3)425,
39(4)363,
39(6)713,
40(1)73,
40(2)279,
41(1)73,
41(4)475,
42(1)7,
42(1)65,
42(2)141,
43(1)59,
43(3)351,
44(1)43,
44(2)189,
44(4)411,
44(4)569,
46(1)53,
46(2)273,
47(2)167,
47(2)257,
47(6)923,
48(1)45,
48(2)155,
49(4)593,
49(6)797,
50(1)80,
50(1)128,
50(7)966,
50(8)1023,
50(8)1086,
50(8)1130,
50(9)1349,
50(11)1692,
50(12)2112,
50(15)2805,
50(17)3416,
50(18)3666,
50(18)3743,
51(1)14,
51(1)153,
51(1)309,
51(4)1060,
51(4)1121,
51(6)1705,
51(8)1922,
51(8)1981,
51(9)2368,
51(10)2554,
51(11)3125,
51(11)3278,
51(11)3294,
51(12)3323,
51(12)3368,
51(12)3549,
51(14)4189,
52(1)215,
52(1)248,
52(3)563,
52(3)581,
52(3)650,
52(7)1433,
52(10)2045,
52(18)3392,
53(14)2517,
53(16)2810
- randomized,
52(18)3307,
53(14)2458
- requirement,
37(2)221,
41(5)549,
42(2)231,
42(3)285,
47(2)151,
49(5)661,
51(2)398,
51(16)4634
- subject,
35(6)737,
36(5)733,
37(6)787,
38(6)829,
39(6)845,
40(6)747,
40(6)779,
41(6)823,
42(6)822,
43(6)823,
44(6)875,
45(6)863,
46(6)884,
47(6)943,
48(6)993,
49(6)898,
50(18)3795