1158 search results - page 88 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
132
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
174
click to vote
ESA
2007
Springer
16 years 8 days ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
171
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...
179
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
126
Voted
ANOR
2007
15 years 6 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...