Suchergebnisse - "exponential time algorithm"

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

“… Arc Kayles and Colored Arc Kayles are generalized versions of well-studied combinatorial games Cram and Domineering, respectively. In Arc Kayles, two players …”
Volltext

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the \sqrt Dimension Threshold von Guruswami, Venkatesan, Hsieh, Jun-Ting, Raghavendra, Prasad

“… We consider the task of certifying that a random d-dimensional subspace X in \mathbb{R}^{\gamma} is well-spread - every vec-tor \chi\in X satisfies …”
Volltext

Biased initialization in random walk algorithms for k -SAT: a generalization of Schöning's method von Ghosh, Subhas Kumar, Vittamsetti, Vijay Monic

Volltext

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

“… Averaging time series under dynamic time warping is an important tool for improving nearest-neighbor classifiers and formulating centroid-based clustering. The …”
Volltext

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

“… Cram , Domineering , and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges …”
Volltext

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets von Huber, Katharina T., van Iersel, Leo, Moulton, Vincent, Scornavacca, Celine, Wu, Taoyang

“… Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 …”
Volltext

A program to compute the soft Robinson–Foulds distance between phylogenetic networks von Lu, Bingxin, Zhang, Louxin, Leong, Hon Wai

“… Background Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic …”
Volltext

An exponential time 2-approximation algorithm for bandwidth von Fürer, Martin, Gaspers, Serge, Kasiviswanathan, Shiva Prasad

“… The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent …”
Volltext

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

“… Given a graph G=(V,E) and a set S⊆V, a set U⊆V is a subset feedback vertex set of (G,S) if no cycle in G[V∖U] contains a vertex of S. The Subset Feedback …”
Volltext

Fast exact algorithm for L(2,1)-labeling of graphs von Junosza-Szaniawski, Konstanty, Kratochvíl, Jan, Liedloff, Mathieu, Rossmanith, Peter, Rzążewski, Paweł

“… An L(2,1)-labeling of a graph is a mapping from its vertex set into nonnegative integers such that the labels assigned to adjacent vertices differ by at least …”
Volltext

Solving SCS for bounded length strings in fewer than 2n steps von Golovnev, Alexander, Kulikov, Alexander S., Mihajlin, Ivan

“… It is still not known whether a shortest common superstring (SCS) of n input strings can be found faster than in O⁎(2n) time (O⁎(⋅) suppresses polynomial …”
Volltext

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs von Bang-Jensen, Jørgen, Saurabh, Saket, Simonsen, Sven

“… A well known result in graph algorithms, due to Edmonds, states that given a digraph D and a positive integer ℓ , we can test whether D contains ℓ arc-disjoint …”
Volltext

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem von Okamoto, Yoshio, Otachi, Yota, Uehara, Ryuhei, Uno, Takeaki

Volltext

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between von Gaspers, Serge, Sorkin, Gregory B.

“… In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general …”
Volltext

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

“… We present a moderately exponential time and polynomial space algorithm for sparse instances of Max SAT. Our algorithms run in time of the form O 2 ( 1 − μ ( c …”
Volltext

On Independent Sets and Bicliques in Graphs von Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu

“… Bicliques of graphs have been studied extensively, partially motivated by the large number of applications. In this paper we improve Prisner’s upper bound on …”
Volltext

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

“… The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G …”
Volltext

New algorithms for Exact Satisfiability von Byskov, Jesper Makholm, Madsen, Bolette Ammitzbøll, Skjernaa, Bjarke

“… The Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability …”
Volltext

Computing branchwidth via efficient triangulations and blocks von Fomin, Fedor V., Mazoit, Frédéric, Todinca, Ioan

“… Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing …”
Volltext

A Randomized Algorithm for 3-SAT von Ghosh, Subhas Kumar, Misra, Janardan

“… In this work we propose and analyze a simple randomized algorithm for 3-SAT (i.e. an algorithm to find a satisfiable assignment for a Boolean formula in …”
Volltext