From post

An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.

, , , и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 249-261. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover., , , и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 249-261. Springer, (2002)Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling., и . FOCS, стр. 137-149. IEEE Computer Society, (2007)Clause Learning Can Effectively P-Simulate General Propositional Resolution., , , и . AAAI, стр. 283-290. AAAI Press, (2008)Clause Learning, Resolution Space, and Pebbling.. University of Toronto, Canada, (2009)Formalizing Dangerous SAT Encodings., , и . SAT, том 4501 из Lecture Notes in Computer Science, стр. 159-172. Springer, (2007)