2137 search results - page 94 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
113
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
141
click to vote
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
118
Voted
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
133
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...