3894 search results - page 81 / 779 » Approximation Algorithms for Biclustering Problems |
141
click to vote
DAM
2007
15 years 6 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
173
click to vote
TAMC
2009
Springer
16 years 22 days ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
165
click to vote
CCCG
2010
15 years 7 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
152
click to vote
CEC
2008
IEEE
16 years 20 days ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
161
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...