369 search results - page 17 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
209
click to vote
NLP
2000
15 years 3 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
101
click to vote
ICML
2003
IEEE
16 years 17 days ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
87
Voted
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...