3894 search results - page 130 / 779 » Approximation Algorithms for Biclustering Problems |
147
click to vote
IPL
2008
15 years 6 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
159
click to vote
IPL
2007
15 years 6 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
159
click to vote
WG
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
138
click to vote
ISAAC
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
151
click to vote
QEST
2006
IEEE
16 years 12 days ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...