4843 search results - page 42 / 969 » The Shortcut Problem - Complexity and Approximation |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
JCAM
2011
12 years 11 months ago
2011
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
13 years 3 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
MP
2006
13 years 8 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...