Výsledky vyhľadávania - Exact exponential time algorithm

Semi-Exact Exponential-Time Algorithms: an Experimental Study Autor El-Wahab, Mohamed Mahmoud Abd, Abu-Khzam, Faisal N., Wang, Kai, Shaw, Peter

“…The last decade witnessed an increased interest in exact and parameterized exponential-time algorithms for NP - hard problems…”
Získať plný text

An Exact Exponential Time Algorithm for Power Dominating Set Autor Binkele-Raible, Daniel, Fernau, Henning

“… We show that Power Dominating Set remains -hard on cubic graphs. We design an algorithm solving this problem in time on general graphs, using polynomial space…”
Získať plný text

An exact exponential time algorithm for counting bipartite cliques Autor Kutzkov, Konstantin

“… ► Exact exponential time algorithm for counting bipartite cliques. ► A new simplification rule for handling degree-1 vertices. ► Measure & Conquer analysis…”
Získať plný text

Exact exponential-time algorithms for finding bicliques Autor Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu

“… ( 1.6914 n ) -time algorithm for this problem. It is based on an algorithm for bipartite graphs that runs in time O ( 1.30052 n…”
Získať plný text

Faster winner determination algorithms for (Colored) Arc Kayles Autor Hanaka, Tesshu, Kiya, Hironori, Lampis, Michael, Ono, Hirotaka, Yoshiwatari, Kanae

“…)-time algorithms are known, where n is the number…”
Získať plný text

Exact algorithms for counting 3-colorings of graphs Autor Zhu, Enqiang, Wu, Pu, Shao, Zehui

“… In this paper, we focus on the design of exact algorithms for counting 3-colorings of a graph (denoted by #3-Coloring…”
Získať plný text

Exact mean computation in dynamic time warping spaces Autor Brill, Markus, Fluschnik, Till, Froese, Vincent, Jain, Brijnesh, Niedermeier, Rolf, Schultz, David

“… Then we propose an exponential-time dynamic program for computing a global minimum of the Fréchet function. The proposed algorithm is useful for benchmarking and evaluating known heuristics…”
Získať plný text

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem Autor Binkele-Raible, Daniel, Fernau, Henning

“… By designing a branching algorithm analyzed with Measure&Conquer, we show that the problem can be solved in time O⁎(1.9044n…”
Získať plný text

Winner Determination Algorithms for Graph Games with Matching Structures Autor Hanaka, Tesshu, Kiya, Hironori, Ono, Hirotaka, Yoshiwatari, Kanae

“… We first observe that the winner determination for Colored Arc Kayles can be done in O ∗ ( 2 n ) time by a simple algorithm, where n is the order of the input graph…”
Získať plný text

Faster exact algorithms for some terminal set problems Autor Chitnis, Rajesh, Fomin, Fedor V., Lokshtanov, Daniel, Misra, Pranabendu, Ramanujan, M.S., Saurabh, Saket

“… In this paper, we introduce a general method to obtain faster exact exponential time algorithms for several terminal set problems…”
Získať plný text

Moderate exponential-time algorithms for scheduling problems Autor T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu

“…, exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms…”
Získať plný text

New exact algorithms for the 2-constraint satisfaction problem Autor Golovnev, Alexander, Kutzkov, Konstantin

“…) steps uses exponential space. Several authors have designed algorithms with running time O⁎(2nf(d)) where f:R+→(0,1…”
Získať plný text

Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds Autor Gupta, Sushmita, Raman, Venkatesh, Saurabh, Saket

“… That is, we can enumerate all the maximal $r$-regular induced subgraphs in time $\mathcal{O}(c^n n^{\mathcal{O}(1)})$. A related question is that of finding a maximum-sized…”
Získať plný text

Exact and Parameterized Algorithms for Max Internal Spanning Tree Autor Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu

“… This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form with c ≤2…”
Získať plný text

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets Autor Casel, Katrin, Fernau, Henning, Gaspers, Serge, Gras, Benjamin, Schmid, Markus L.

“…). It is known that, for unbounded alphabets, the decision variant of this problem is N P -hard and the optimisation variant does not allow a polynomial-time approximation scheme, unless P = N P…”
Získať plný text

Stable Matching Games: Manipulation via Subgraph Isomorphism Autor Gupta, Sushmita, Roy, Sanjukta

Získať plný text

Moderate exponential-time algorithms for scheduling problems Autor T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu

“…, exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms…”
Získať plný text

Subset feedback vertex sets in chordal graphs Autor Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter, Saei, Reza

“… We give an algorithm with running time O(1.6708n) that enumerates all minimal subset feedback vertex sets on chordal graphs on n vertices…”
Získať plný text

On Two Techniques of Combining Branching and Treewidth Autor Fomin, Fedor V., Gaspers, Serge, Saurabh, Saket, Stepanov, Alexey A.

“…Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems…”
Získať plný text

Exact exponential algorithms for 3-machine flowshop scheduling problems Autor Shang, Lei, Lenté, Christophe, Liedloff, Mathieu, T’Kindt, Vincent

“…In this paper, we focus on the design of an exact exponential time algorithm with a proved worst-case running time for 3-machine flowshop scheduling problems considering worst-case scenarios…”
Získať plný text