429 search results - page 35 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
AAAI
2006
14 years 11 months ago
2006
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
IPL
2007
14 years 9 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...