Sciweavers

2862 search results - page 72 / 573
» Bicriteria Network Design Problems
Sort
View
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CRITIS
2006
15 years 1 months ago
Applying Key Infrastructures for Sensor Networks in CIP/CIIP Scenarios
It is commonly agreed that Wireless Sensor Networks (WSN) is one of the technologies that better fulfills features like the ones required by Critical (Information) Infrastructures....
Cristina Alcaraz, Rodrigo Roman
MCS
2006
Springer
14 years 10 months ago
Variable projections neural network training
8 The training of some types of neural networks leads to separable non-linear least squares problems. These problems may be9 ill-conditioned and require special techniques. A robus...
V. Pereyra, G. Scherer, F. Wong
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
14 years 11 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
JCO
2010
182views more  JCO 2010»
14 years 8 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu