This is an automatically generated report which runs the algorithm on given graphs. There is a graph, its integer linear program solution, linear program solution, enhancement of the linear program and approximation result.
| Graph | ILP | LP | Enhancement | Aproximation | Enh Apx |
|---|---|---|---|---|---|
| comet | 2 | 1.6363636363636362e+00 | 2 | 10 | 2 |
| comet-alt | 4 | 4 | 4 | 4 | 4 |
| clique | 30 | 9.9999999999999982e+00 | 9.9999999999999982e+00 | 30 | 30 |
| star | 34 | 34 | 34 | 34 | 34 |
| path | 4 | 4 | 4 | 4 | 4 |
| tree | 12 | 10.5 | 12 | 12 | 12 |
| petersen | 12 | 2.6666666666666670e+00 | 7.9999999999999991e+00 | 12 | 12 |
The source vertex is s = 0 and capacity is k = 12.
The source vertex is s = 12 and capacity is k = 10.
The source vertex is s = 0 and capacity is k = 3.
The source vertex is s = 1 and capacity is k = 4.
The source vertex is s = 0 and capacity is k = 6.
The source vertex is s = 0 and capacity is k = 15.
The source vertex is s = 0 and capacity is k = 6.