31 search results - page 2 / 7 » Constrained LCS: Hardness and Approximation |
NETWORKS
2011
14 years 6 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
SIAMCO
2002
14 years 11 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
124
click to vote
ISCAS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
CCCG
2010
15 years 1 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...