( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.

, , и . Electron. Colloquium Comput. Complex., (2008)

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.

Peter Karpinski

Hannelore Karpinski

Kurt Karpinski

Peter Karpinski

Werner Karpinski

 

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

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)., , , и . Dagstuhl Reports, 5 (6): 28-47 (2015)Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields., , и . SIAM J. Comput., 19 (6): 1059-1063 (1990)Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , и . SODA, стр. 74-83. ACM/SIAM, (2002)A QPTAS for the Base of the Number of Triangulations of a Planar Point Set., , и . CoRR, (2014)Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)., , , и . CPM, том 1075 из Lecture Notes in Computer Science, стр. 39-49. Springer, (1996)A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2., , и . ISAAC (1), том 6506 из Lecture Notes in Computer Science, стр. 15-24. Springer, (2010)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , и . Algorithmica, 80 (2): 560-575 (2018)On a Sublinear Time Parallel Construction of Optimal Binary Search Trees., и . Parallel Process. Lett., 8 (3): 387-397 (1998)Approximating the Volume of General Pfaffian Bodies., и . Structures in Logic and Computer Science, том 1261 из Lecture Notes in Computer Science, стр. 162-173. Springer, (1997)Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis., , и . ISSAC, стр. 117-122. ACM, (1992)