Suchergebnisse - "subexponential-time algorithm"

A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs von 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 …”
Volltext

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters von 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 …”
Volltext

The Complexity of Tree Partitioning von 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 …”
Volltext

A transfer method from bounded existential Diophantine equations to Tarski algebra formulas von 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 …”
Volltext

Subexponential LPs Approximate Max-Cut von 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 …”
Volltext

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses von 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 …”
Volltext