Entry Middendorf:1998:SCS from tcs1995.bib
Last update: Sun Oct 15 02:56:11 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{Middendorf:1998:SCS,
author = "Martin Middendorf",
title = "Shortest common superstrings and scheduling with
coordinated starting times",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "205--214",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2669.pdf",
acknowledgement = ack-nhfb,
classification = "C1290F (Systems theory applications in industry);
C4240 (Programming and algorithm theory); C4240C
(Computational complexity)",
corpsource = "Inst. fur Angewandte Inf. und Formale
Beschreibungsverfahren, Karlsruhe Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2-machine flow-shop; complexity; computational
complexity; coordinated starting times; NP-complete;
open-shop; scheduling; Shortest Common Superstring;
string matching; strings",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- application,
137(2)177,
140(2)231,
140(2)301,
141(1)337,
148(1)67,
154(1)41,
156(1)1,
157(2)139,
159(1)15,
160(1)145,
160(1)185,
161(1)1,
161(1)301,
164(1)223,
165(2)391,
167(1)131,
172(1)175,
175(2)239,
176(1)111,
177(2)407,
180(1)243,
181(2)379,
183(2)187,
186(1)199,
187(1)221,
187(1)263,
187(1)z,
188(1)45,
192(2)233,
194(1)240-2,
194(1)242-1,
196(1)31,
196(1)319,
200(1)135,
201(1)1,
210(1)121,
215(1)31,
217(1)115,
217(2)175,
219(1)487
- common,
143(1)113,
143(2)353,
144(1)3,
145(1)317,
147(1)31,
147(1)267,
154(2)225,
155(1)265,
157(1)3,
162(2)173,
164(1)277,
177(1)111,
194(1)241-3,
207(2)319
- complete;, NP-,
137(1)129,
143(2)353,
147(1)117,
148(1)93,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
197(1)245-2,
198(1)211
- coordinated,
192(2)287
- matching,
137(2)269,
141(1)53,
145(1)111,
145(1)381,
147(1)19,
154(2)203,
154(2)225,
155(2)321,
156(1)217,
158(1)177,
159(1)105,
160(1)217,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
173(2)349,
177(2)425,
178(1)129,
180(1)115,
180(1)203,
181(1)159,
185(2)347,
197(1)247-2,
198(1)1,
201(1)263,
201(1)281,
212(1)101,
220(2)469
- Middendorf, Martin,
145(1)317,
164(1)73,
215(1)137
- NP-complete,
137(1)129,
143(2)353,
147(1)117,
147(1)137,
148(1)19,
148(1)93,
155(2)321,
161(1)289,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
186(1)157,
197(1)245-2,
198(1)211
- scheduling,
144(1)277,
145(1)329,
147(1)1,
162(2)225,
162(2)323,
162(2)341,
164(1)73,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
181(2)357,
183(2)281,
196(1)347,
196(1)395,
215(1)137,
215(1)209,
220(1)157
- shortest,
140(2)265,
140(2)291,
143(1)113,
143(2)343,
143(2)353,
144(1)161,
145(1)317,
161(1)123,
168(1)121,
172(1)303,
182(1)183,
186(1)171,
203(1)143,
203(2)205,
207(1)105,
209(1)287
- string,
137(2)269,
141(1)53,
141(1)163,
143(1)113,
145(1)357,
147(1)19,
154(2)203,
154(2)225,
155(2)425,
155(2)447,
158(1)177,
161(1)1,
161(1)123,
161(1)289,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
178(1)129,
180(1)203,
181(1)159,
191(1)219,
194(1)87,
211(1)339,
218(1)205
- superstrings,
143(1)113,
161(1)1