Sciweavers

14161 search results - page 21 / 2833
» On generalized middle-level problem
Sort
View
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 8 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 1 months ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ICALP
2003
Springer
14 years 1 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
CDC
2009
IEEE
116views Control Systems» more  CDC 2009»
14 years 6 days ago
On the linear-exponential filtering problem for general Gaussian processes
The explicit solution of the filtering problem with exponential criteria for a general Gaussian signal is obtained through an approach which is based on a conditional Cameron-Mart...
Marina L. Kleptsyna, Alain Le Breton, Michel Viot
DISOPT
2010
132views more  DISOPT 2010»
13 years 8 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...