Results 1  10
of
1,841,891
Algorithms for the Set Covering Problem
 Annals of Operations Research
, 1998
"... The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and masstransit companies. ..."
Abstract

Cited by 90 (4 self)
 Add to MetaCart
The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and masstransit companies.
Fast Approximation Algorithms for Fractional Packing and Covering Problems
, 1995
"... This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed ..."
Abstract

Cited by 263 (13 self)
 Add to MetaCart
This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques
Covering Problems
"... The mailorder DVDrental company Netflix chooses distribution center locations so that most of its customers receive their DVDs within one business day via firstclass U.S. mail. Similarly, many municipalities aim to have fire crews reach 911 callers within a specified time, such as four minutes. B ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The mailorder DVDrental company Netflix chooses distribution center locations so that most of its customers receive their DVDs within one business day via firstclass U.S. mail. Similarly, many municipalities aim to have fire crews reach 911 callers within a specified time, such as four minutes. Both of these are examples of the notion of coverage, a concept that is central to several classes of facility
Covering problems with hard capacities
 IN PROC OF. FOCS’02
, 2002
"... We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generali ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural
The Online Set Cover Problem
 STOC'03
, 2003
"... Let X = {1, 2,...,n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives eleme ..."
Abstract

Cited by 61 (6 self)
 Add to MetaCart
Let X = {1, 2,...,n} be a ground set of n elements, and let S be a family of subsets of X, S  = m, with a positive cost cS associated with each S ∈S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives
Facility Location and Covering Problems
"... We discuss the connection between facility location problems and covering problems, and present approaches to solving facility location problems by reducing them to covering problems. In particular, we discuss the following NPhard optimization problems: the set cover and the related set cover facil ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We discuss the connection between facility location problems and covering problems, and present approaches to solving facility location problems by reducing them to covering problems. In particular, we discuss the following NPhard optimization problems: the set cover and the related set cover
On Solving Binate Covering Problems
 In The Proceedings of the Design Automation Conference
, 1996
"... Binate (or unate) covering problems occur at several steps during logic synthesis including twolevel minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of binate covering problem solv ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Binate (or unate) covering problems occur at several steps during logic synthesis including twolevel minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of binate covering problem
The Probabilistic Set Covering Problem
 OPERATIONS RESEARCH
, 2001
"... In a probabilistic set covering problem the right hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyse the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enu ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In a probabilistic set covering problem the right hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyse the structure of the set of probabilistically efficient points of binary random vectors, develop methods
Complexity of Graph Covering Problems
 Nordic Journal of Computing
, 1998
"... For a fixed graph H , the Hcover problem asks whether an input graph G allows a degree preserving mapping f : V (G) ! V (H) such that for every v 2 V (G), f(NG (v)) = NH (f(v)). In this paper we design efficient algorithms for certain graph covering problems according to two basic techniques. The ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
For a fixed graph H , the Hcover problem asks whether an input graph G allows a degree preserving mapping f : V (G) ! V (H) such that for every v 2 V (G), f(NG (v)) = NH (f(v)). In this paper we design efficient algorithms for certain graph covering problems according to two basic techniques
On Solving Covering Problems
 in Proceedings of the Design Automation Conference
, 1996
"... The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) arise throughout the logic synthesis flow. This paper investigates the complexity and approximation ratio of two lower bound computation algorithms from both a theoretical and p ..."
Abstract
 Add to MetaCart
The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) arise throughout the logic synthesis flow. This paper investigates the complexity and approximation ratio of two lower bound computation algorithms from both a theoretical
Results 1  10
of
1,841,891