Maximizing pagerank with new backlinks
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the approximability of the link building problem
Theoretical Computer Science
| Hi-index | 0.00 |
We study the theory and techniques developed in the research of parameterized intractability, emphasizing on parameterized hardness and completeness that imply (stronger) computational lower bounds for natural computational problems. Moreover, the fundamentals of the structural properties in parameterized complexity theory, relationships to classical complexity theory and more recent developments in the area are also introduced.