58:
240:
143:
213:
274:
279:
224:
218:
75:
70:
184:
29:
306:
189:
262:
114:
316:
172:
311:
245:
138:
378:
353:
340:
257:
46:
41:
17:
109:
328:
92:
373:
126:
301:
284:
97:
230:
160:
289:
367:
235:
155:
201:
28:
The following 39 pages are in this category, out of 39 total.
80:
8:
25:Pages in category "Approximation algorithms"
241:Minimum relevant variables in linear system
144:Fully polynomial-time approximation scheme
59:(1+ε)-approximate nearest neighbor search
214:Max/min CSP/Ones classification theorems
30:This list may not reflect recent changes
275:Parameterized approximation algorithm
7:
280:Polynomial-time approximation scheme
225:Methods of successive approximation
219:Method of conditional probabilities
76:Approximation-preserving reduction
34:
22:
14:
71:Alpha max plus beta min algorithm
185:K-approximation of k-hitting set
1:
307:Shortest common supersequence
263:Nearest neighbour algorithm
115:Convex volume approximation
395:
317:Superadditive set function
15:
173:Hardness of approximation
312:Subadditive set function
246:Multi-fragment algorithm
139:Farthest-first traversal
354:Vertex k-center problem
341:Unique games conjecture
258:Nearest neighbor search
190:Karloff–Zwick algorithm
47:Submodular set function
42:Approximation algorithm
18:Approximation algorithm
110:Christofides algorithm
93:Baker's technique
329:Token reconfiguration
127:Domination analysis
302:Set cover problem
386:
356:
285:Property testing
227:
98:Bidimensionality
394:
393:
389:
388:
387:
385:
384:
383:
364:
363:
362:
361:
360:
359:
352:
345:
333:
321:
294:
267:
250:
231:Metric k-center
223:
206:
194:
177:
165:
161:GNRS conjecture
148:
131:
119:
102:
85:
63:
51:
21:
20:
12:
11:
5:
392:
390:
382:
381:
379:Approximations
376:
366:
365:
358:
357:
349:
346:
344:
343:
337:
334:
332:
331:
325:
322:
320:
319:
314:
309:
304:
298:
295:
293:
292:
290:PTAS reduction
287:
282:
277:
271:
268:
266:
265:
260:
254:
251:
249:
248:
243:
238:
233:
228:
221:
216:
210:
207:
205:
204:
198:
195:
193:
192:
187:
181:
178:
176:
175:
169:
166:
164:
163:
158:
152:
149:
147:
146:
141:
135:
132:
130:
129:
123:
120:
118:
117:
112:
106:
103:
101:
100:
95:
89:
86:
84:
83:
78:
73:
67:
64:
62:
61:
55:
52:
50:
49:
44:
38:
36:
35:
26:
23:
16:Main article:
13:
10:
9:
6:
4:
3:
2:
391:
380:
377:
375:
372:
371:
369:
355:
351:
350:
347:
342:
339:
338:
335:
330:
327:
326:
323:
318:
315:
313:
310:
308:
305:
303:
300:
299:
296:
291:
288:
286:
283:
281:
278:
276:
273:
272:
269:
264:
261:
259:
256:
255:
252:
247:
244:
242:
239:
237:
236:Minimum k-cut
234:
232:
229:
226:
222:
220:
217:
215:
212:
211:
208:
203:
200:
199:
196:
191:
188:
186:
183:
182:
179:
174:
171:
170:
167:
162:
159:
157:
156:Gap reduction
154:
153:
150:
145:
142:
140:
137:
136:
133:
128:
125:
124:
121:
116:
113:
111:
108:
107:
104:
99:
96:
94:
91:
90:
87:
82:
79:
77:
74:
72:
69:
68:
65:
60:
57:
56:
53:
48:
45:
43:
40:
39:
37:
33:
31:
24:
19:
27:
202:L-reduction
374:Algorithms
368:Categories
81:APX
54:0–9
370::
32:.
348:V
336:U
324:T
297:S
270:P
253:N
209:M
197:L
180:K
168:H
151:G
134:F
122:D
105:C
88:B
66:A
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.