Entry Frederickson:1982:RBB from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Frederickson:1982:RBB,
author = "G. N. Frederickson and J. Ja'Ja",
title = "On the relationship between the biconnectivity
augmentation and traveling salesman problems",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "189--201",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C1290 (Applications of
systems theory)",
corpsource = "Dept. of Computer Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation algorithm; biconnected subgraph;
biconnectivity augmentation; Christofides' algorithm;
graph theory; operations research; optimal
biconnection; optimal traveling salesman tour;
optimisation; traveling salesman problems; weighted
graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- application,
13(3)271,
14(2)155,
18(1)41,
18(2)115,
18(2)207,
23(1)49,
27(1)3,
31(1)31,
32(1)121,
34(1)3
- approximation,
10(1)1,
10(1)53,
11(3)321,
11(3)331,
11(3)337,
12(2)161,
12(3)303,
14(3)289,
15(2)201,
15(3)251,
16(2)231,
20(3)323,
22(1)195,
23(3)273,
24(1)73,
24(3)291,
28(1)135,
28(3)287,
29(1)1,
31(1)125
- biconnected,
32(1)185
- C1160,
11(1)39,
11(1)93,
11(2)117,
11(2)123,
11(3)247,
12(1)83,
13(2)137,
13(3)315,
14(1)103,
15(1)1,
15(2)159,
15(3)321,
16(1)5,
17(1)29,
17(1)75,
17(1)91,
17(1)103,
17(2)151,
17(2)217,
18(1)89,
18(2)115,
18(3)259,
19(1)1,
19(1)17,
19(1)29,
19(1)69,
21(1)55,
21(1)91,
21(1)99,
22(3)233,
22(3)253,
22(3)331,
23(1)37,
23(1)83,
23(2)129,
23(2)211,
23(3)231,
23(3)243,
23(3)273,
24(2)143,
24(2)161,
25(2)95,
25(3)311,
28(1)171,
29(1)49,
29(1)75,
29(3)251,
30(3)241,
31(1)31,
31(1)61,
31(1)73,
31(3)307,
32(1)1,
32(1)87,
32(1)121,
32(1)173,
32(1)185,
32(1)215,
32(3)227,
32(3)309,
33(2)239,
34(1)3,
34(1)17,
34(1)33,
34(1)83,
34(1)169,
34(3)275,
34(3)337,
34(3)343
- C1180,
10(2)123,
11(1)1,
12(1)83,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(3)337,
21(1)99,
21(3)255
- Frederickson, G. N.,
29(1)75
- operation,
11(3)303,
12(2)175,
14(2)127,
21(3)315,
22(3)253,
23(3)231,
32(1)121,
33(1)117,
34(1)157
- optimal,
10(2)123,
10(3)297,
11(1)39,
14(1)79,
16(2)177,
22(3)297,
29(1)1
- optimisation,
10(2)123,
11(1)1,
12(1)83,
14(1)79,
14(1)103,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(3)337,
21(1)99,
21(3)255
- relationship,
19(3)337,
21(3)315,
24(2)161,
24(3)331,
26(3)301
- research,
11(2)207
- salesman,
15(3)279
- subgraph,
10(2)111,
17(1)91,
32(1)185
- technique,
10(2)123,
11(1)1,
11(2)145,
12(1)83,
12(3)325,
13(1)61,
13(1)109,
14(1)19,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(3)321,
19(3)337,
21(1)99,
21(3)255,
22(1)19,
24(1)1,
31(1)13,
32(1)77,
33(1)117,
33(1)z
- traveling,
15(3)279