Entry Edelsbrunner:1989:TNC from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
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{Edelsbrunner:1989:TNC,
author = "Herbert Edelsbrunner and Guenter Rote and Ermo Welzl",
title = "Testing the necklace condition for shortest tours and
optimal factors in the plane",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "157--180",
day = "20",
month = aug,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C1290
(Applications of systems theory); C4240 (Programming
and algorithm theory)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "combinatorial analysis; complexity results;
computational complexity; Computer
Programming--Algorithms; graph theory; intersection
graphs; Mathematical Programming; Necklace Condition;
necklace condition; operations research; Optimal
Factors; optimal factors; Shortest Tours; shortest
tours; Traveling Salesman Problem; traveling salesman
tour",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)181,
67(1)65
- analysis,
36(2)145,
36(2)251,
39(1)15,
39(1)z,
40(2)301,
43(1)81,
46(2)141,
46(2)239,
47(3)299,
49(2)267,
51(1)27,
52(3)269,
53(1)99,
54(1)129,
55(2)265,
56(1)17,
56(1)59,
58(1)155,
59(1)157,
61(2)225,
61(2)259,
62(3)251,
63(1)91,
65(1)1,
65(1)35,
65(2)249,
65(2)z,
67(2)261,
68(1)57,
69(1)55,
69(1)69,
69(2)117
- application,
35(2)271,
37(2)217,
48(2)135,
49(2)113,
49(2)171,
49(2)217,
55(2)141,
57(1)47,
57(2)251,
64(1)107,
64(2)175,
69(1)69
- C1290,
37(2)217
- condition,
35(2)215,
36(1)27,
39(2)309,
40(1)13,
40(2)301,
41(2)223,
43(1)11,
43(2)251,
46(1)53,
48(1)1,
48(2)297,
52(3)269,
53(1)3,
53(2)169,
56(2)223,
56(3)321,
57(2)303,
58(1)81,
61(1)17,
61(2)137,
66(1)113,
66(3)233,
66(3)341
- factor,
41(1)61,
44(1)107,
45(1)63,
48(1)35,
57(2)303,
58(1)3,
58(1)201,
60(3)341,
63(3)333,
64(2)175
- intersection,
35(2)261,
38(1)55,
45(2)121,
49(2)267,
49(2)z,
56(2)211,
58(1)69,
58(1)129,
59(1)181
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- operation,
35(2)271,
36(2)291,
36(2)333,
39(2)327,
40(2)257,
42(2)123,
47(3)237,
48(2)145,
48(2)273,
49(2)185,
51(3)281,
52(1)1,
52(3)251,
55(2)183,
55(2)265,
58(1)175,
60(3)297,
61(2)199,
62(1)3,
62(3)235,
64(1)119,
64(3)221,
68(1)71
- optimal,
39(1)15,
39(1)z,
45(1)63,
53(2)281,
53(2)295,
59(3)259,
59(3)297,
61(1)33,
63(2)203,
64(1)83,
64(1)125,
64(2)159,
66(1)105,
66(2)137,
67(1)5
- plane,
49(2)239,
61(2)175,
68(3)239
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)181,
67(1)65
- research,
40(2)257
- result,
35(1)1,
35(2)227,
52(3)177,
58(1)143,
58(1)155,
61(2)259,
62(3)267,
65(1)35,
65(3)291
- shortest,
53(2)201,
57(0)3,
57(1)131,
60(3)285,
66(0)117
- testing,
35(1)109,
37(2)151,
38(2)323,
41(1)81,
44(1)69,
46(2)175,
47(3)277,
50(3)241,
50(3)285,
53(2)225,
56(2)211,
61(2)225,
64(2)175,
66(3)299,
66(3)333,
69(2)117
- tour,
66(0)117