J
Jakub Onufry Wojtaszczyk
Researcher at Google
Publications - 7
Citations - 60
Jakub Onufry Wojtaszczyk is an academic researcher from Google. The author has contributed to research in topics: Network planning and design & Graph (abstract data type). The author has an hindex of 3, co-authored 7 publications receiving 52 citations.
Papers
More filters
Journal ArticleDOI
On some extensions of the FKN theorem
TL;DR: A simple and elementary proof of Friedgut, Kalai, and Naor's result that if Var(jSj) is much smaller than Var(S), then the sum is largely determined by one of the summands is provided.
Journal ArticleDOI
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2n
TL;DR: An O(1.933n) algorithm for 2-Disjoint Connected Subgraphs in general case is presented, thus breaking the 2n barrier and it is shown that if the authors parameterize the problem by the number of non-terminal vertices, it is hard both to speed up the brute-force approach and to find a polynomial kernel.
Book ChapterDOI
Solving the 2-disjoint connected subgraphs problem faster than 2 n
TL;DR: An O(1.933n) algorithm for 2-Disjoint Connected Subgraphs in general case is presented, thus breaking the 2n barrier and it is shown that if the authors parameterize the problem by the number of non-terminal vertices, it is hard both to speed up the brute-force approach and to find a polynomial kernel.
Book ChapterDOI
Approximation schemes for capacitated geometric network design
TL;DR: This work designs a quasi-polynomial time approximation scheme for the capacitated geometric network design problem allowing for arbitrary number of sinks, and relies on a derivation of an upper bound on the number of vertices different from sources and sinks in an optimal network.
Journal ArticleDOI
Approximation Schemes for Capacitated Geometric Network Design
TL;DR: This work designs a quasi-polynomial time approximation scheme for the capacitated geometric network design problem allowing for an arbitrary number of sinks, and relies on a derivation of an upper bound on the number of vertices different from sources and sinks in an optimal network.