( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2.

, , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 15-24. Springer, (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

Peter Karpinski

Hannelore Karpinski

Kurt Karpinski

Peter Karpinski

Peter Karpinski

 

Other publications of authors with the same name

An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3., , and . Inf. Process. Lett., 42 (6): 309-313 (1992)Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields., , and . SIAM J. Comput., 19 (6): 1059-1063 (1990)On the Approximability of Independent Set Problem on Power Law Graphs., and . CoRR, (2015)Top-K Color Queries for Document Retrieval, and . CoRR, (2010)Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications., , , and . Algorithmica, 80 (2): 772-800 (2018)Polynomial time approximation schemes for dense instances of NP-hard problems., , and . STOC, page 284-293. ACM, (1995)On real Turing machines that toss coins., , , , and . STOC, page 335-342. ACM, (1995)Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis., , and . ISSAC, page 117-122. ACM, (1992)A Lower Bound for Randomized Algebraic Decision Trees., , , and . STOC, page 612-619. ACM, (1996)A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 15-24. Springer, (2010)