Výsledky vyhledávání - "Subexponential-time algorithm"

A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs Autor 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…”
Získat plný text

A subexponential-time algorithm for the Maximum Independent Set Problem in P^sub t^-free graphs Autor 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…”
Získat plný text

A Tight Subexponential-time Algorithm for Two-Page Book Embedding Autor 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…”
Získat plný text

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints Autor Nederlof, Jesper, Swennenhuis, Céline M F, Węgrzycki, Karol

“…In a classical scheduling problem, we are given a set of \(n\) jobs of unit length along with precedence constraints, and the goal is to find a schedule of…”
Získat plný text

A subexponential-time algorithm for computing discrete logarithms overGF(p^2) Autor Elgamal, T.

“…An algorithm for computing discrete logarithms over GF (p^{2}) , where p is a prime, in subexponential time is described. The algorithm is similar to the…”
Získat plný text

A subexponential-time algorithm for computing discrete logarithms over GF(p2) Autor TAHER ELGAMAL

Získat plný text

A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space Autor Regev, Oded

“…In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem…”
Získat plný text

Subexponential-Time Algorithms for Sparse PCA Autor 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…”
Získat plný text

Subexponential-Time Algorithms for Maximum Independent Set in P t -Free and Broom-Free Graphs Autor 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…”
Získat plný text

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs Autor 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…”
Získat plný text

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

Získat plný text

Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs Autor 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…”
Získat plný text

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters Autor 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…”
Získat plný text

The Complexity of Tree Partitioning Autor 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…”
Získat plný text

Grid induced minor theorem for graphs of small degree Autor Korhonen, Tuukka

“… It also implies that for any fixed planar graph H, there is a subexponential time algorithm for maximum weight independent set on H-induced-minor-free graphs…”
Získat plný text

Matching Cut in Graphs with Large Minimum Degree Autor Chen, Chi-Yeh, Hsieh, Sun-Yuan, Le, Hoang-Oanh, Le, Van Bang, Peng, Sheng-Lung

“… ut has no subexponential-time algorithm in the number of vertices unless the Exponential-Time Hypothesis fails…”
Získat plný text

Subexponential-Time Algorithms for Sparse PCA Autor 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…”
Získat plný text

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle Autor Deligkas, Argyrios, Mertzios, George B., Spirakis, Paul G., Zamaraev, Viktor

“… Despite substantial efforts, no subexponential-time algorithm is known for this problem…”
Získat plný text

A transfer method from bounded existential Diophantine equations to Tarski algebra formulas Autor 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…”
Získat plný text

Subexponential LPs Approximate Max-Cut Autor 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…”
Získat plný text