Publications
Publications
Referenzen
133.
Cristina Bazgan, W. Fernandez de la Vega und Marek Karpinski
Approximability of dense instances of NEAREST CODEWORD problem
Algorithm theory---SWAT 2002 Band 2368 aus Lecture Notes in Comput. Sci.
Seite 298--307.
Herausgeber: Springer, Berlin,
2002
132.
Marek Karpinski
Approximability of the minimum bisection problem: an algorithmic challenge
Mathematical foundations of computer science 2002 Band 2420 aus Lecture Notes in Comput. Sci.
Seite 59--67.
Herausgeber: Springer, Berlin,
2002
131.
Piotr Berman, Marek Karpinski und Yakov Nekrich
Approximating Huffman codes in parallel
Automata, languages and programming Band 2380 aus Lecture Notes in Comput. Sci.
Seite 845--855.
Herausgeber: Springer, Berlin,
2002
130.
Piotr Berman und Marek Karpinski
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION
Automata, languages and programming Band 2380 aus Lecture Notes in Comput. Sci.
Seite 623--632.
Herausgeber: Springer, Berlin,
2002
129.
Béla Csaba, Marek Karpinski und Piotr Krysta
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA , Seite 74--83.
Herausgeber: ACM, New York
2002
128.
Piotr Berman und Marek Karpinski
Approximating minimum unsatisfiability of linear equations
SODA , Seite 514--516.
Herausgeber: ACM, New York
2002
127.
Noga Alon, W. Fernandez de la Vega, Ravi Kannan und Marek Karpinski
Random sampling and approximation of MAX-CSP problems
Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing , Seite 232--239.
Herausgeber: ACM, New York,
2002
126.
Uriel Feige, Marek Karpinski und Michael Langberg
A note on approximating Max-Bisection on regular graphs
Inform. Process. Lett., 79(4):181--188
2001
125.
Piotr Berman und Marek Karpinski
Efficient Amplifiers and Bounded Degree Optimization
Electronic Colloquium on Computational Complexity (ECCC), 8(53)
2001
124.
Piotr Berman und Marek Karpinski
Improved Approximations for General Minimum Cost Scheduling
Electronic Colloquium on Computational Complexity (ECCC), 8(097)
2001
123.
Marek Karpinski
Approximating bounded degree instances of NP-hard problems
Fundamentals of computation theory (Riga, 2001) Band 2138 aus Lecture Notes in Comput. Sci.
Seite 24--34.
Herausgeber: Springer, Berlin,
2001
122.
Lars Engebretsen und Marek Karpinski
Approximation hardness of TSP with bounded metrics
Automata, languages and programming Band 2076 aus Lecture Notes in Comput. Sci.
Seite 201--212.
Herausgeber: Springer, Berlin,
2001
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