429 search results - page 13 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
102
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
ALGORITHMICA
2004
14 years 9 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
COMGEO
2010
ACM
14 years 10 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
TCS
2008
14 years 9 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...