Search Results - Moderately exponential time algorithm

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability by Nagao, Atsuki, Seto, Kazuhisa, Teruyama, Junichi

“…We present a satisfiability algorithm for k -indexed binary decision diagrams ( k -IBDDs). The proposed exponential space and deterministic algorithm solves the satisfiability of k -IBDDs…”
Get full text

Moderately exponential time algorithms for the maximum induced matching problem by Chang, Maw-Shang, Chen, Li-Hsuan, Hung, Ling-Ju

“… The Maximum Induced Matching problem is to find an induced matching of maximum cardinality. It is NP-hard. Branch-and-reduce algorithms proposed in the previous results for the Maximum Induced Matching problem use a standard branching rule…”
Get full text

Exact algorithms for Kayles by Bodlaender, Hans L., Kratsch, Dieter, Timmer, Sjoerd T.

“… To analyze the running time of the algorithm, we introduce the notion of a K-set: a nonempty set of vertices W…”
Get full text

An Exact Exponential Time Algorithm for Power Dominating Set by 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…”
Get full text

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

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

Moderately exponential time and fixed parameter approximation algorithms by Escoffier, Bruno, Paschos, Vangelis Th, Tourniaire, Emeric

“…We survey approximation issues matching ideas and tools from the fields of polynomial approximation, moderately exponential computation and fixed parameter tractability aiming at designing…”
Get full text

Exact Algorithms for L(2,1)-Labeling of Graphs by Havet, Frédéric, Klazar, Martin, Kratochvíl, Jan, Kratsch, Dieter, Liedloff, Mathieu

“… We present exact exponential time algorithms that are faster than the naive O * (( k +1) n ) algorithm that would try all possible mappings…”
Get full text

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

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

Fast algorithms for min independent dominating set by Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.Th

“… We then study approximation of the problem by moderately exponential time algorithms and show that it can be approximated within ratio 1+ϵ, for any ϵ…”
Get full text

A new upper bound for Max-2-SAT: A graph-theoretic approach by Binkele-Raible, Daniel, Fernau, Henning

“… We present an algorithm yielding a run time upper bound of O ⁎ ( 2 K 6.265 ) for Max-2-Sat (each clause contains at most 2 literals…”
Get full text

Exact and Approximate Digraph Bandwidth by Jain, Pallavi, Kanesh, Lawqueen, Lochet, Willian, Saurabh, Saket, Sharma, Roohani

“…In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately…”
Get full text

Computing the differential of a graph: Hardness, approximability and exact algorithms by Bermudo, S., Fernau, H.

“… Moreover, we also provide a Measure & Conquer analysis for an exact moderately exponential-time algorithm that computes that graph parameter in time O(1.755n…”
Get full text

On Two Techniques of Combining Branching and Treewidth by 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…”
Get full text

Approximating MAX SAT by moderately exponential and parameterized algorithms by Escoffier, Bruno, Paschos, Vangelis Th, Tourniaire, Emeric

“… The general goal of the issue of moderately exponential approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly…”
Get full text

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem by Bourgeois, Nicolas, Giannakos, Aristotelis, Lucarelli, Giorgio, Milis, Ioannis, Paschos, Vangelis Th

“…•Improvements upon the exhaustive exponential complexity for densest k-subgraph.•Describe trade-offs between complexity and approximability for densest k-subgraph…”
Get full text

A satisfiability algorithm and average-case hardness for formulas over the full binary basis by Seto, Kazuhisa, Tamaki, Suguru

“…We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis…”
Get full text

Approximation of min coloring by moderately exponential algorithms by Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

“…We study in this note approximation algorithms for the problem of coloring the vertices of a graph with as few colors as possible, with moderately exponential running times…”
Get full text

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction by Sakai, Takayuki, Seto, Kazuhisa, Tamaki, Suguru

“…We present a moderately exponential time and polynomial space algorithm for sparse instances of Max SAT…”
Get full text

Algorithms for dominating clique problems by Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.Th

“…- and a minimum-size dominating clique of a graph G, if G has a dominating clique. For the three problems we propose exact moderately exponential algorithms with worst-case running time upper bounds improving those by Kratsch and Liedloff [D. Kratsch, M…”
Get full text

Complexity of Fall Coloring for Restricted Graph Classes by Lauri, Juho, Mitillos, Christodoulos

“…We strengthen a result by Laskar and Lyle (Discrete Appl. Math. 157 , 330–338 2009 ) by proving that it is NP-complete to decide whether a bipartite planar…”
Get full text