Publications
Publications
Referenzen
169.
Wenceslas Fernandez de la Vega, Ravi Kannan und Marek Karpinski
Approximation of Global MAX-CSP Problems
Electronic Colloquium on Computational Complexity (ECCC), 13(124)
2006
168.
Wenceslas Fernandez de la Vega und Marek Karpinski
On the Sample Complexity of MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 13(104)
2006
167.
Wenceslas Fernandez de la Vega und Marek Karpinski
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP
Electronic Colloquium on Computational Complexity (ECCC), 13(155)
2006
166.
Lars Engebretsen und Marek Karpinski
TSP with bounded metrics
J. Comput. System Sci., 72(4):509--546
2006
165.
Magnus Bordewich, Martin Dyer und Marek Karpinski
Stopping times, metrics and approximate counting
Automata, languages and programming. Part I Band 4051 aus Lecture Notes in Comput. Sci.
Seite 108--119.
Herausgeber: Springer, Berlin,
2006
164.
Piotr Berman und Marek Karpinski
8/7-approximation algorithm for (1,2)-TSP
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms , Seite 641--648.
Herausgeber: ACM, New York,
2006
163.
Marek Karpinski, Ion I. M\uandoiu, Alexander Olshevsky und Alexander Zelikovsky
Improved approximation algorithms for the quality of service multicast tree problem
Algorithmica, 42(2):109--120
2005
162.
Farid Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore und Christopher Pollett
On the computational power of probabilistic and quantum branching program
Inform. and Comput., 203(2):145--162
2005
161.
Klaus Jansen, Marek Karpinski, Andrzej Lingas und Eike Seidel
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
SIAM J. Comput., 35(1):110--119
2005
160.
Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer und Andrzej Lingas
Embedding point sets into plane graphs of small dilation
Algorithms and computation Band 3827 aus Lecture Notes in Comput. Sci.
Seite 5--16.
Herausgeber: Springer, Berlin,
2005
159.
Cristina Bazgan und Marek Karpinski
On the complexity of global constraint satisfaction (extended abstract)
Algorithms and computation Band 3827 aus Lecture Notes in Comput. Sci.
Seite 624--633.
Herausgeber: Springer, Berlin,
2005
158.
Magnus Bordewich, Martin Dyer und Marek Karpinski
Path coupling using stopping times
Fundamentals of computation theory Band 3623 aus Lecture Notes in Comput. Sci.
Seite 19--31.
Herausgeber: Springer, Berlin,
2005
Seite:  
Previous | Publications, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next
Export als:
BibTeX, XML