Entry Krumke:1999:IMC from jalg.bib
Last update: Sat Oct 14 02:35:45 MDT 2017
Top |
Symbols |
Numbers |
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{Krumke:1999:IMC,
author = "S. O. Krumke and M. V. Marathe and H. Noltemeier and
R. Ravi and S. S. Ravi and R. Sundaram and H.-C Wirth",
title = "Improving Minimum Cost Spanning Trees by Upgrading
Nodes",
journal = j-J-ALG,
volume = "33",
number = "1",
pages = "92--111",
month = oct,
year = "1999",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1006/jagm.1999.1021",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:17:53 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677499910210",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
Related entries
- cost,
11(1)85,
11(4)581,
19(1)116,
21(2)415,
30(2)423,
34(1)54,
34(1)148,
42(2)277,
44(2)359
- Improving,
16(1)1
- minimum,
1(1)51,
4(3)282,
8(2)260,
8(4)480,
9(3)299,
12(1)38,
13(1)33,
13(2)297,
13(3)374,
14(1)115,
15(1)125,
15(1)173,
15(2)267,
17(2)237,
17(3)424,
19(1)116,
19(2)173,
19(3)383,
21(3)520,
23(2)375,
24(1)171,
27(2)303,
28(1)105,
28(2)197,
28(2)272,
28(2)339,
29(2)204,
33(1)51,
33(1)112,
33(2)244,
38(1)170,
38(2)411,
41(1)1,
41(2)330,
42(2)255,
44(2)359,
48(1)220,
48(2)385,
51(2)107,
56(2)77,
59(1)1,
60(1)24
- node,
22(1)57,
33(1)15,
50(1)49
- Noltemeier, H.,
10(2)212
- Ravi, R.,
19(1)104,
28(1)142,
29(1)132,
37(1)66
- Ravi, S. S.,
26(2)238,
28(1)142
- spanning,
1(1)51,
2(1)77,
4(3)214,
7(1)105,
8(2)260,
8(4)592,
9(4)507,
10(2)271,
13(1)33,
15(1)173,
17(2)237,
19(3)383,
24(1)171,
24(2)310,
27(2)170,
28(1)105,
29(1)132,
32(1)21,
32(1)31,
33(2)244,
34(1)177,
36(2)182,
38(2)411,
39(1)1,
41(1)1,
44(2)359,
48(1)220,
48(2)441