1554 search results - page 71 / 311 » Parameterized Complexity and Approximation Algorithms |
98
Voted
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
124
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
141
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
127
click to vote
IPL
2002
15 years 2 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
233
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...