Results 21 to 30 of about 2,709,850 (294)
Exact and Approximation Algorithms for Clustering [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pankaj K. Agarwal +1 more
openaire +1 more source
Exact Algorithms for Kayles [PDF]
In the game of Kayles, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has a winning strategy in this game.
Hans L. Bodlaender, Dieter Kratsch
openaire +3 more sources
05301 Abstracts Collection – Exact Algorithms and Fixed-Parameter Tractability [PDF]
From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractability'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Woeginger, Gerhard +2 more
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +2 more
openaire +5 more sources
We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source
PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM
The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem:
Chandra Agung, Natalia Christine
doaj +1 more source
Quantum‐based exact pattern matching algorithms for biological sequences
In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in ON time, whereas quantum algorithm design is based on ...
Kapil Kumar Soni, Akhtar Rasool
doaj +1 more source
Optimal Clustering in Stable Instances Using Combinations of Exact and Noisy Ordinal Queries
This work studies clustering algorithms which operates with ordinal or comparison-based queries (operations), a situation that arises in many active-learning applications where “dissimilarities” between data points are evaluated by humans.
Enrico Bianchi, Paolo Penna
doaj +1 more source
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck +5 more
doaj +1 more source
Exact Algorithms for Intervalizing Colored Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +1 more
openaire +6 more sources

