121 citations · 375 across the 53 of their papers we have counts for
4 papers · 1 filter
On subexponential running times for approximating directed Steiner tree and related problems
Marek Cygan, Guy Kortsarz, Bundit Laekhanukit
This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, le…
Randomized contractions meet lean decompositions
Marek Cygan, Paweł Komosa, Daniel Lokshtanov +4
We show an algorithm that, given an -vertex graph and a parameter , in time finds a tree decomposition of with the following properties: *…
Online Facility Location with Deletions
Marek Cygan, Artur Czumaj, Marcin Mucha +1
In this paper we study three previously unstudied variants of the online Facility Location problem, considering an intrinsic scenario when the clients and facilities are not only a…
Improved GQ-CNN: Deep Learning Model for Planning Robust Grasps
Maciej Jaśkowski, Jakub Świątkowski, Michał Zając +7
Recent developments in the field of robot grasping have shown great improvements in the grasp success rates when dealing with unknown objects. In this work we improve on one of the…