Výsledky vyhledávání - "f.2.2 [analysis of algorithms AND problems complexity]: non-numerical algorithms AND problems*"

Polynomial-Time Data Reduction for DOMINATING SET.

Autoři: Alber, Jochen Fellows, Michael R. Niedermeier, Rolf

Zdroj: Journal of the ACM; May2004, Vol. 51 Issue 3, p363-384, 22p

Témata: NP-complete problems, COMPUTATIONAL complexity, GRAPH theory, DATA reduction, TOPOLOGY, COMBINATORIAL optimization, MATHEMATICAL optimization

On Hard Instances of Approximate Vertex Cover.

Autoři: Vishwanathan, Sundar

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p7-7:6, 6p

Témata: VERTEX operator algebras, OPERATOR theory, FUNCTIONAL analysis, APPROXIMATION theory, MATHEMATICAL functions, ALGORITHMS