Sciweavers

16404 search results - page 78 / 3281
» A set coverage problem
Sort
View
102
Voted
CL
2000
Springer
15 years 5 months ago
Modelling Digital Circuits Problems with Set Constraints
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
Francisco Azevedo, Pedro Barahona
99
Voted
SIAMJO
2008
85views more  SIAMJO 2008»
15 years 16 days 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
72
Voted
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
15 years 5 months ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon
147
Voted
WG
2005
Springer
15 years 6 months ago
Approximation Algorithms for the Weighted Independent Set Problem
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
15 years 6 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin