( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
8/7-approximation algorithm for (1, 2)-TSP.

, and . SODA, page 641-648. ACM Press, (2006)

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

Werner Karpinski

 

Other publications of authors with the same name

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)Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)., , , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 39-49. Springer, (1996)The Equivalences Problems for Binary EOL-Systems are Decidable.. FCT, volume 56 of Lecture Notes in Computer Science, page 423-434. Springer, (1977)On the Computational Complexity of Measuring Global Stability of Banking Networks., , , and . Algorithmica, 70 (4): 595-647 (2014)An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions., , and . Nord. J. Comput., 4 (2): 172-186 (1997)A QPTAS for the Base of the Number of Triangulations of a Planar Point Set., , and . CoRR, (2014)