Sciweavers

503 search results - page 41 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
109
Voted
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 3 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
136
Voted
JGAA
2006
127views more  JGAA 2006»
15 years 3 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
117
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 4 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
159
Voted
EC
2008
153views ECommerce» more  EC 2008»
15 years 3 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
142
Voted
IWPEC
2009
Springer
15 years 10 months ago
On the Directed Degree-Preserving Spanning Tree Problem
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...