2698 search results - page 251 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
162
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
188
click to vote
ESA
2005
Springer
16 years 1 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
158
click to vote
PARELEC
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
179
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
187
click to vote
PREMI
2005
Springer
16 years 2 days ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...