Entry Moran:1981:GAA 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{Moran:1981:GAA,
author = "S. Moran",
title = "General approximation algorithms for some arithmetical
combinatorial problems",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "289--303",
month = jun,
year = "1981",
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 = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation algorithm; computational complexity;
hard optimization; maximal integer; minimal integer;
nonlinear programming; polynomial; worst case relative
error",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- approximation,
10(1)1,
10(1)53,
11(3)321,
11(3)331,
11(3)337,
12(2)161,
12(3)303,
15(2)201,
15(3)251,
16(2)231,
19(2)189,
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
- arithmetical,
17(2)113,
21(3)255
- C1180,
10(2)123,
11(1)1,
12(1)83,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(2)189,
19(3)337,
21(1)99,
21(3)255
- case,
13(1)61,
18(3)325,
19(3)305,
22(3)331,
29(1)1
- computational,
10(1)1,
10(1)53,
10(1)83,
10(2)171,
10(3)221,
11(1)1,
11(1)71,
11(1)93,
11(3)321,
12(1)97,
12(2)119,
12(2)161,
12(3)255,
12(3)291,
13(3)271,
13(3)295,
14(1)1,
14(1)91,
14(3)227,
14(3)247,
14(3)337,
15(1)77,
15(2)181,
15(2)201,
15(3)291,
15(3)321,
16(1)25,
16(1)99,
16(2)115,
16(3)279,
17(1)55,
17(2)213,
17(3)303,
18(1)95,
18(1)105,
18(3)259,
19(1)1,
19(1)17,
19(1)39,
19(2)161,
19(2)203,
19(3)337,
20(3)323,
21(1)1,
21(1)105,
21(2)179,
21(3)255,
22(1)19,
22(1)195,
22(3)285,
22(3)317,
23(2)171,
23(2)187,
23(3)333,
24(2)123,
24(3)221,
24(3)239,
24(3)279,
24(3)291,
25(2)95,
25(2)193,
26(1)197,
26(3)287,
26(3)327,
27(1)3,
27(3)241,
28(1)111,
28(1)135,
28(3)277,
29(1)123,
30(3)241,
30(3)319,
31(1)41,
31(1)101,
31(1)125,
31(1)175,
32(1)61,
32(1)77,
32(1)157,
32(1)173,
32(1)221,
32(3)227,
32(3)279,
33(1)117,
33(2)261,
33(2)305,
34(1)17,
34(1)83,
34(1)207,
34(3)337
- error,
17(1)99,
23(2)211,
24(1)95,
24(1)105,
34(3)289
- general,
13(2)231,
16(2)199,
16(3)329,
18(2)207,
19(2)143,
19(3)305,
24(1)1,
25(2)193,
31(1)41,
32(1)157,
33(2)175
- hard,
11(3)331,
17(1)55,
23(2)211
- integer,
11(2)207,
14(3)211,
14(3)247,
19(1)17,
23(1)83,
23(1)95,
24(1)35,
28(3)263,
31(1)125
- maximal,
14(1)103,
15(3)279,
16(2)211
- minimal,
12(3)325,
16(2)211,
17(1)103,
19(1)1,
23(3)305,
30(2)205,
31(1)41
- Moran, S.,
15(3)251,
19(1)17,
24(1)35
- nonlinear,
15(1)27,
15(2)181,
16(2)231,
19(1)39,
22(1)195,
32(1)47
- optimisation,
10(2)123,
11(1)1,
12(1)83,
14(1)79,
14(1)103,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(2)189,
19(3)337,
21(1)99,
21(3)255
- optimization,
12(1)83,
15(3)251,
15(3)279,
18(1)41
- polynomial,
10(1)1,
10(1)53,
10(2)111,
11(1)93,
11(3)321,
11(3)331,
11(3)337,
12(1)1,
12(2)161,
12(3)303,
13(3)271,
14(1)91,
15(1)27,
15(1)77,
15(3)251,
15(3)279,
15(3)329,
16(2)223,
17(1)91,
17(2)163,
18(1)95,
19(1)17,
19(3)287,
21(1)99,
21(1)105,
21(2)179,
21(3)255,
22(1)195,
22(3)285,
22(3)317,
23(1)95,
24(3)291,
25(1)67,
26(1)25,
27(1)3,
27(1)127,
28(1)135,
31(1)101,
31(1)125,
31(3)227,
32(1)61,
32(3)279,
34(1)17,
34(1)207
- relative,
23(1)49,
24(1)73,
31(1)101
- 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,
15(1)27,
15(3)251,
15(3)279,
16(2)187,
19(1)1,
19(2)189,
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