Keyword: sets

Found 278 papers in total
Coloring large graphs based on independent set extraction
Coloring large graphs based on independent set extraction
2012,
This paper presents an effective approach (EXTRACOL) to coloring large graphs. The...
Computing the Cover Array in Linear Time
Computing the Cover Array in Linear Time
2002,
Let x denote a given nonempty string of length n = |x| . A proper...
Near‐Linear Approximation Algorithms for Geometric Hitting Sets
Near‐Linear Approximation Algorithms for Geometric Hitting Sets
2012,
Given a range space ( X , ℛ ) , where ℛ ⊂ 2 X , the hitting set...
On the Hitting Times of Quantum Versus Random Walks
On the Hitting Times of Quantum Versus Random Walks
2012,
The hitting time of a classical random walk (Markov chain) is the time required to...
Sorting by Short Block‐Moves
Sorting by Short Block‐Moves
2000,
Sorting permutations by operations such as reversals and block‐moves has...
Different generalizations of bags
Different generalizations of bags
2012,
We consider four different generalizations of bags (alias multisets). We first discuss...
Equivalence of e ‐Approximate Separation and Optimization in Fixed Dimensions
Equivalence of e ‐Approximate Separation and Optimization in Fixed Dimensions
2001,
Given a closed, convex set X\subseteq \bbR n , containing the origin, we consider the...
Circular Separability of Polygons
Circular Separability of Polygons
2001,
Two planar sets are circularly separable if there exists a circle enclosing one of the...
Approximation of Geometric Dispersion Problems
Approximation of Geometric Dispersion Problems
2001,
We consider problems of distributing a number of points within a polygonal region P ,...
Grade of Service Steiner Minimum Trees in the Euclidean Plane
Grade of Service Steiner Minimum Trees in the Euclidean Plane
2001,
Let P = {p 1 , p 2 , \ldots, p n } be a set of n {\lilsf terminal points} in the...
A characterisation of stable sets in preordered structure
A characterisation of stable sets in preordered structure
2012,
This article characterises stable sets in preordered sets. We show that every stable...
Set partitioning and packing versus assignment formulations for subassembly matching problems
Set partitioning and packing versus assignment formulations for subassembly matching problems
2011,
This paper addresses alternative formulations and model enhancements for two...
Quality assessment of coupled civil engineering applications
Quality assessment of coupled civil engineering applications
2011,
The software scenery in civil engineering is characterized by a large number of more...
A Unified Approach to Approximating Partial Covering Problems
A Unified Approach to Approximating Partial Covering Problems
2011,
An instance of the generalized partial cover problem consists of a ground set U and a...
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
2010,
We propose a new generic framework for solving combinatorial optimization problems...
Comparing local search metaheuristics for the maximum diversity problem
Comparing local search metaheuristics for the maximum diversity problem
2011,
The Maximum Diversity Problem (MDP) requires to extract a subset M of given...
Cost sharing and strategy-proof mechanisms for set cover games
Cost sharing and strategy-proof mechanisms for set cover games
2010,
We develop for set cover games several general cost-sharing methods that are...
Effective heuristics for the Set Covering with Pairs Problem
Effective heuristics for the Set Covering with Pairs Problem
2010,
This paper deals with the Set Covering with Pairs Problem (SCPP). This problem is a...
Polynomial time approximation schemes for minimum disk cover problems
Polynomial time approximation schemes for minimum disk cover problems
2010,
The following planar minimum disk cover problem is considered in this paper: given a...
A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code
A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code
2010,
The multiple-choice multi-period knapsack problem lies on the interface of multiple...
A one-to-one correspondence between colorings and stable sets
A one-to-one correspondence between colorings and stable sets
2008,
Given a graph G , we construct an auxiliary graph &Gtilde; with &mmacr; vertices such...
Multivariate optimisation for procurement of emergency services equipment – Teams of the best or the best of teams?
Multivariate optimisation for procurement of emergency services equipment – Teams of the best or the best of teams?
2010,
It is shown that the design of some inventory structures such as critical protective...
Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows
Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows
2010,
A safety and security issue of concern for traffic managers and homeland security is...
A computational approach to pivot selection in the LP relaxation of set problems
A computational approach to pivot selection in the LP relaxation of set problems
2006,
It has long been known to the researchers that choosing a variable having the most...
Papers per page: