Name
Abstract | ||
|---|---|---|
One of the main objectives of the talk is to survey the history of the practical algorithmic strategy of preprocessing (also called data-reduction and kernelization) since the beginnings of computer science, and to overview what theoretical computer science has been able to say about it. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11847250_25 | IWPEC |
Keywords | Field | DocType |
lost continent,theoretical computer science,practical algorithmic strategy,polynomial time,computer science,main objective,data reduction | Kernelization,Algorithmics,Algorithm,Theoretical computer science,Preprocessor,Vertex cover,Time complexity,Kernel method,Mathematics | Conference |
Volume | ISSN | ISBN |
4169 | 0302-9743 | 3-540-39098-7 |
Citations | PageRank | References |
21 | 0.80 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael R. Fellows | 1 | 4138 | 319.37 |