Results 261 to 270 of about 2,306,078 (295)
Exact algorithms for dominating set
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender, Johan M M Van Rooij
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Communications of the ACM, 2013
Discovering surprises in the face of intractability.
Fedor V. Fomin, Petteri Kaski
openaire +2 more sources
Discovering surprises in the face of intractability.
Fedor V. Fomin, Petteri Kaski
openaire +2 more sources
Bilinear programming: An exact algorithm
Mathematical Programming, 1977The Bilinear Programming Problem is a structured quadratic programming problem whose objective function is, in general, neither convex nor concave. Making use of the formal linearity of a dual formulation of the problem, we give a necessary and sufficient condition for optimality, and an algorithm to find an optimal solution.
Giorgio Gallo, Aydin Ülkücü
openaire +6 more sources
Exact algorithms for circles on the sphere
Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98, 1998We describe exact representations and algorithms for geometric operations on general circles and circular arcs on the sphere, using integer homogeneous coordinates. The algorithms include testing a point against a circle, computing the intersection of two circles, and ordering three arcs out of the same point.
Marcus Vinícius Alvim Andrade +1 more
openaire +2 more sources
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Algorithmica, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Björklund, Andreas, Husfeldt, Thore
openaire +4 more sources
EXACT ALGORITHMS FOR MOTIF SEARCH
Proceedings of the 3rd Asia-Pacific Bioinformatics Conference, 2005In this paper we study the problem of identifying meaningful patterns (i.e., motifs) from biological data. The general version of this problem is NP-hard. Numerous algorithms have been proposed in the literature to solve this problem. Many of these algorithms fall under the category of approximation algorithms.
Sanguthevar Rajasekaran +6 more
openaire +2 more sources
Exact Algorithms and Complexity
2010Over the past couple of decades, a series of exact exponential-time algorithms have been developed with improved run times for a number of problems including IndependentSet, k-SAT, and k-colorability using a variety of algorithmic techniques such as backtracking, dynamic programming, and inclusion-exclusion.
openaire +1 more source
Exact Algorithms for Graph Homomorphisms
Theory of Computing Systems, 2005Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if G is k-colorable. During recent years the topic of exact (exponential-time) algorithms for NP-hard problems in general, and for graph coloring in particular, has led to ...
Fedor V. Fomin +2 more
openaire +3 more sources
A randomized algorithm for exact transduction
2014Random sampling is an efficient method dealing with constrained optimization problems. In computational geometry, it has been applied, through Clarkson's algorithm [10], to solve a general class of problems called violator spaces. In machine learning, TSVM is a learning method used when only a small fraction of labeled data is available, which implies ...
Gennaro Esposito, Mario Martín
openaire +1 more source
Complexity and Exact Algorithms for Multicut
2006The Multicut problem is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainly focus on the case of removing vertices, where we distinguish between allowing or disallowing the removal of terminal vertices.
Jiong Guo +4 more
openaire +1 more source