Entry Ausiello:1995:ASN 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{Ausiello:1995:ASN,
author = "G. Ausiello and P. Crescenzi and M. Protasi",
title = "Approximate solution of {NP} optimization problems",
journal = j-THEOR-COMP-SCI,
volume = "150",
number = "1",
pages = "1--55",
day = "16",
month = oct,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:27 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=150&issue=1&aid=1925",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4210 (Formal
logic); C4240C (Computational complexity)",
corpsource = "Dipartimento di Inf. e Sistemistica, Rome Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximate solution; approximation algorithms;
approximation preserving reducibilities; class APX;
combinatorial properties; computational complexity;
decidability; FPTAS; maximum satisfiability problem; NP
optimization problems; optimisation; optimization
problems; polynomial-time approximation; PTAS;
reducibility; unified framework",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- approximate,
145(1)271,
149(1)129,
161(1)307,
172(1)91,
173(1)113,
179(1)319,
181(1)159,
188(1)79,
191(1)229,
201(1)263,
203(1)151,
210(2)341,
219(1)185
- approximation,
134(1)51,
137(1)145,
138(1)3,
143(1)167,
143(2)353,
144(1)67,
147(1)267,
154(1)41,
157(1)3,
157(1)53,
157(1)115,
157(1)129,
157(2)161,
157(2)259,
158(1)117,
159(2)143,
161(1)1,
161(1)307,
162(2)173,
162(2)351,
165(1)57,
168(1)3,
168(1)39,
172(1)255,
173(1)49,
174(1)23,
177(1)3,
178(1)265,
179(1)319,
179(1)427,
180(1)17,
180(1)243,
181(2)379,
182(1)233,
187(1)87,
187(1)105,
187(1)179,
187(1)z,
190(2)151,
190(2)167,
191(1)1,
197(1)111,
207(1)171,
209(1)107,
210(2)261,
210(2)327,
212(1)261,
266(1)997
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- class,
139(1)187,
140(1)179,
140(2)291,
141(1)175,
143(1)149,
144(1)251,
145(1)111,
148(2)207,
149(2)201,
149(2)299,
151(2)385,
152(1)67,
152(2)251,
153(1)49,
154(1)23,
154(2)145,
154(2)307,
154(2)367,
155(1)111,
155(1)141,
155(2)447,
157(2)227,
158(1)193,
158(1)221,
158(1)361,
160(1)305,
161(1)263,
161(1)301,
161(1)307,
162(1)5,
163(1)245,
163(1)283,
164(1)287,
165(2)355,
167(1)171,
170(1)407,
172(1)43,
172(1)91,
174(1)67,
174(1)231,
174(1)269,
176(1)39,
176(1)205,
177(1)59,
177(1)139,
178(1)37,
179(1)217,
180(1)139,
180(1)155,
180(1)217,
180(1)325,
183(1)93,
185(1)159,
185(1)177,
186(1)231,
188(1)79,
188(1)101,
190(1)87,
191(1)215,
194(1)137,
194(1)246,
195(1)33,
195(2)113,
195(2)183,
195(2)205,
197(1)247,
198(1)225,
203(1)123,
207(1)217,
209(1)225,
211(1)253,
226(1)29,
234(1)323
- Crescenzi, P.,
203(1)51,
205(1)261
- decidability,
138(1)3,
139(1)1,
139(1)27,
141(1)253,
145(1)111,
146(1)243,
147(1)149,
147(1)165,
148(2)227,
148(2)281,
154(1)23,
154(1)107,
155(2)321,
155(2)447,
156(1)119,
157(1)115,
158(1)161,
160(1)145,
160(1)185,
161(1)93,
161(1)141,
161(1)191,
164(1)29,
164(1)123,
164(1)141,
164(1)223,
165(2)247,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
168(2)241,
168(2)z,
170(1)1,
170(1)445,
172(1)67,
172(1)309,
174(1)217,
174(1)269,
175(1)15,
175(1)127,
175(1)z,
176(1)67,
176(1)111,
176(1)175,
176(1)235,
179(1)301,
180(1)61,
180(1)203,
183(1)83,
183(2)215,
186(1)231,
193(1)149,
193(1)181,
193(1)197,
194(1)87,
194(1)219,
195(1)33,
195(2)113,
197(1)79,
197(1)245,
198(1)1,
215(1)169,
216(1)363
- framework,
137(1)3,
138(1)211,
139(1)187,
139(1)207,
140(1)53,
140(1)139,
151(1)163,
152(2)305,
163(1)161,
166(1)173,
168(1)53,
169(1)39,
173(2)349,
175(1)29,
183(2)187,
185(1)191,
186(1)43,
190(2)241,
196(1)45,
196(1)289
- maximum,
140(2)301,
145(1)357,
147(1)181,
148(1)165,
158(1)117,
164(1)277,
174(1)23,
181(1)91,
181(1)107,
181(2)307,
191(1)193,
196(1)201
- NP,
137(2)279,
141(1)175,
145(1)111,
145(1)147,
147(1)55,
147(1)181,
148(2)207,
148(2)325,
154(2)145,
154(2)283,
157(2)161,
158(1)143,
158(1)221,
160(1)185,
164(1)59,
164(1)141,
174(1)97,
181(2)229,
189(1)239
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- preserving,
145(1)271,
168(1)155,
179(1)397,
207(1)43,
212(1)261,
266(1)997
- reducibility,
142(2)299,
148(2)183,
155(2)447,
164(1)141,
191(1)185,
234(1)323
- satisfiability,
137(1)129,
139(1)1,
145(1)111,
146(1)243,
155(1)277,
160(1)365,
161(1)109,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
172(1)233,
175(2)349,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183
- solution,
145(1)71,
148(1)67,
155(1)267,
157(1)115,
161(1)93,
161(1)307,
168(1)121,
168(2)367,
173(1)3,
173(1)113,
178(1)265,
181(2)379,
187(1)27,
191(1)229,
205(1)307,
215(1)1,
216(1)395,
225(1)171
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- unified,
156(1)217,
176(1)337,
190(2)363