Search Results - "Subexponential-Time Algorithms"

Subexponential-Time Algorithms for Sparse PCA by Ding, Yunzi, Kunisky, Dmitriy, Wein, Alexander S., Bandeira, Afonso S.

“…We study the computational cost of recovering a unit-norm sparse principal component x ∈ R n planted in a random matrix, in either the Wigner or Wishart spiked…”
Get full text

Subexponential-Time Algorithms for Maximum Independent Set in P t -Free and Broom-Free Graphs by Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

“…). Here we study the existence of subexponential-time algorithms for the problem: we show that for any…”
Get full text

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs by Novotná, Jana, Okrasa, Karolina, Pilipczuk, Michał, Rzążewski, Paweł, van Leeuwen, Erik Jan, Walczak, Bartosz

“…Let C and D be hereditary graph classes. Consider the following problem: given a graph G ∈ D , find a largest, in terms of the number of vertices, induced…”
Get full text

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs by Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

Get full text

Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs by Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

“… ). Here we study the existence of subexponential-time algorithms for the problem: we show that for any…”
Get full text

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters by Fomin, Fedor V., Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, Villanger, Yngve

“…In the Cluster Editing problem, also known as Correlation Clustering, we are given an undirected n-vertex graph G and a positive integer k. The task is to…”
Get full text

Subexponential-Time Algorithms for Sparse PCA by Ding, Yunzi, Kunisky, Dmitriy, Wein, Alexander S, Bandeira, Afonso S

“…We study the computational cost of recovering a unit-norm sparse principal component \(x \in \mathbb{R}^n\) planted in a random matrix, in either the Wigner or…”
Get full text

The Complexity of Tree Partitioning by An, Zhao, Feng, Qilong, Kanj, Iyad, Xia, Ge

“…Given a tree T on n vertices, and k , b , s 1 , … , s b ∈ N , the Tree Partitioning  problem asks if at most k edges can be removed from T so that the…”
Get full text

A transfer method from bounded existential Diophantine equations to Tarski algebra formulas by Litow, B.

“…We identify a transfer method from bounded existentially quantified Diophantine equations to formulas of Tarski algebra, the first order theory of the real…”
Get full text

Subexponential LPs Approximate Max-Cut by Hopkins, Samuel B., Schramm, Tselil, Trevisan, Luca

“…We show that for every \varepsilon > 0 , the degree -n^{\varepsilon} Sherali-Adams linear program (with \exp(\tilde{O}(n^{\varepsilon}) ) variables and…”
Get full text

Subexponential-time algorithms for finding large induced sparse subgraphs by Novotná, Jana, Okrasa, Karolina, Pilipczuk, Michał, Rzążewski, Paweł, van Leeuwen, Erik Jan, Walczak, Bartosz

“…Let \(\mathcal{C}\) and \(\mathcal{D}\) be hereditary graph classes. Consider the following problem: given a graph \(G\in\mathcal{D}\), find a largest, in…”
Get full text

Subexponential-time Algorithms for Maximum Independent Set in \(P_t\)-free and Broom-free Graphs by Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

“…, SODA 2014, 570--581, 2014], and an algorithm for \(t=6\) announced recently [Grzesik et al. Arxiv 1707.05491, 2017]. Here we study the existence of subexponential-time algorithms for the problem…”
Get full text

Subexponential time algorithms for finding small tree and path decompositions by Bodlaender, Hans L, Nederlof, Jesper

“…The Minimum Size Tree Decomposition (MSTD) and Minimum Size Path Decomposition (MSPD) problems ask for a given n-vertex graph G and integer k, what is the…”
Get full text

Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems by Marx, Dániel, Tillmann Miltzow

“…Given a set of \(n\) points \(S\) in the plane, a triangulation \(T\) of \(S\) is a maximal set of non-crossing segments with endpoints in \(S\). We present an…”
Get full text

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses by Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon

“…We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time…”
Get full text

A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs by Brause, Christoph

“…The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for…”
Get full text

A subexponential-time algorithm for the Maximum Independent Set Problem in P^sub t^-free graphs by Brause, Christoph

“…The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for…”
Get full text

Local List-Decoding and Testing of Random Linear Codes from High Error by Kopparty, Swastik, Saraf, Shubhangi

“… We also give subexponential time algorithms for list-decoding arbitrary unbiased (but not necessarily sparse…”
Get full text

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds by Bansal, Nikhil, Oosterwijk, Tim, Vredeveld, Tjark, van der Zwaan, Ruben

“…We consider the Vector Scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n…”
Get full text

A Tight Subexponential-time Algorithm for Two-Page Book Embedding by Ganian, Robert, Mueller, Haiko, Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz

“…A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are…”
Get full text