3894 search results - page 50 / 779 » Approximation Algorithms for Biclustering Problems |
168
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
187
click to vote
CIAC
2003
Springer
15 years 9 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
171
click to vote
DAM
2006
15 years 6 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
153
click to vote
AAIM
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
171
click to vote
SIAMCO
2002
15 years 5 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...