#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1997

2018

- This year (3)
- Last 5 years (12)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marcin Mucha, Piotr Sankowski
- 45th Annual IEEE Symposium on Foundations of…
- 2004

We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time O(n/sup w/), where w is the exponent of the best known matrix… (More)

- Marcin Mucha, Piotr Sankowski
- Algorithmica
- 2004

We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n ω/2), whereω is the exponent of the best known matrix multiplication algorithm. Sinceω<2.38, this algorithm… (More)

- Marcin Mucha
- STACS
- 2012

The Travelling Salesman Problem is one the most fundamental and most studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been… (More)

- Marcin Mucha
- SODA
- 2013

In the shortest superstring problem, we are given a set of strings {s1, . . . , sk} and want to find a string that contains all si as substrings and has minimum length. This is a classical problem in… (More)

- Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry
- APPROX-RANDOM
- 1998

In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight.… (More)

- Lukasz Kowalik, Marcin Mucha
- APPROX-RANDOM
- 2008

We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the randomized algorithm… (More)

- Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
- ICALP
- 2017

In the recent years, significant progress has been made in explaining apparent hardness of improving over naive solutions for many fundamental polynomially solvable problems. This came in the form of… (More)

We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time O(n), where ω is the exponent of the best known matrix multiplication… (More)

- Marcin Mucha
- 2007

This is a tutorial on approximation algorithms for the Shortest Superstring Problem (SSP). My intention when writing it was to provide the foundations for actually doing research on this topic. In… (More)

We describe a new approximation algorithm for the asymmetri c maxTSP with triangle inequality. Our algorithm achieves approxim ation factor35/44 which improves on the previous 10/13 factor of Kaplan… (More)