Suchergebnisse - Exact exponential time algorithm

Semi-Exact Exponential-Time Algorithms: an Experimental Study von 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 …”
Volltext

An Exact Exponential Time Algorithm for Power Dominating Set von 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 …”
Volltext

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

“… ► Exact exponential time algorithm for counting bipartite cliques. ► A new simplification rule for handling degree-1 vertices. ► Measure & Conquer analysis …”
Volltext

Exact exponential-time algorithms for finding bicliques von 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 …”
Volltext

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

“… )-time algorithms are known, where n is the number …”
Volltext

Exact algorithms for counting 3-colorings of graphs von 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 …”
Volltext

Exact mean computation in dynamic time warping spaces von 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 …”
Volltext

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem von 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 …”
Volltext

Winner Determination Algorithms for Graph Games with Matching Structures von 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 …”
Volltext

Faster exact algorithms for some terminal set problems von 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 …”
Volltext

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

“… , exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms …”
Volltext

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

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

Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds von 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 …”
Volltext

Exact and Parameterized Algorithms for Max Internal Spanning Tree von 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 …”
Volltext

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets von 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 …”
Volltext

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

Volltext

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

“… , exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms …”
Volltext

Subset feedback vertex sets in chordal graphs von 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 …”
Volltext

On Two Techniques of Combining Branching and Treewidth von 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 …”
Volltext

Exact exponential algorithms for 3-machine flowshop scheduling problems von 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 …”
Volltext