4

The probabilistic longest path problem

Year:
1999
Language:
english
File:
PDF, 141 KB
english, 1999
5

A ( °/2) -approximation algorithm for the maximum independent set problem

Year:
1992
Language:
english
File:
PDF, 221 KB
english, 1992
11

Online maximum -coverage

Year:
2012
Language:
english
File:
PDF, 367 KB
english, 2012
13

Efficient algorithms for themax

Year:
2014
Language:
english
File:
PDF, 320 KB
english, 2014
22

When polynomial approximation meets exact computation

Year:
2018
Language:
english
File:
PDF, 558 KB
english, 2018
23

Probabilistic models for the Steiner Tree problem

Year:
2010
Language:
english
File:
PDF, 216 KB
english, 2010
24

Approximation results for the minimum graph coloring problem

Year:
1994
Language:
english
File:
PDF, 381 KB
english, 1994
27

Local approximations for maximum partial subgraph problem

Year:
2004
Language:
english
File:
PDF, 232 KB
english, 2004
29

The antennas preassignment problem

Year:
2004
Language:
english
File:
PDF, 304 KB
english, 2004
30

A hypocoloring model for batch scheduling

Year:
2005
Language:
english
File:
PDF, 427 KB
english, 2005
35

Reductions, completeness and the hardness of approximability

Year:
2006
Language:
english
File:
PDF, 294 KB
english, 2006
37

Fast reoptimization for the minimum spanning tree problem

Year:
2010
Language:
english
File:
PDF, 457 KB
english, 2010
38

An exact algorithm for MAX-CUT in sparse graphs

Year:
2007
Language:
english
File:
PDF, 148 KB
english, 2007
39

On-line vertex-covering

Year:
2005
Language:
english
File:
PDF, 340 KB
english, 2005
42

Completeness in approximation classes beyond APX

Year:
2006
Language:
english
File:
PDF, 223 KB
english, 2006
50

Differential approximation results for the Steiner tree problem

Year:
2003
Language:
english
File:
PDF, 654 KB
english, 2003