Sciweavers

2254 search results - page 8 / 451
» Computing the minimal covering set
Sort
View
FOCS
2005
IEEE
14 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 4 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 3 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
FSTTCS
2005
Springer
14 years 3 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev
STACS
2012
Springer
12 years 5 months ago
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan