نتایج جستجو برای: turns set covering
تعداد نتایج: 731400 فیلتر نتایج به سال:
We investigate the problem of packing and covering odd (u, v)-trails in a graph. A (u, v)-trail is a (u, v)-walk that is allowed to have repeated vertices but no repeated edges. We call a trail odd if the number of edges in the trail is odd. Let ν(u, v) denote the maximum number of edge-disjoint odd (u, v)-trails, and τ(u, v) denote the minimum size of an edge-set that intersects every odd (u, ...
Given a set of polyhedral cones C1, · · · , Ck ⊂ R, and a convex set D, does the union of these cones cover the set D? In this paper we consider the computational complexity of this problem for various cases such as whether the cones are defined by extreme rays or facets, and whether D is the entire R or a given linear subspace R. As a consequence, we show that it is coNP-complete to decide if ...
A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two...
Then Γ acts cocompactly on X and X , and the orbit spaces X/Γ and X /Γ are closed manifolds with contractible universal covers. The only nontrivial homotopy groups are thus the fundamental groups, π1(X/Γ) ∼= Γ ∼= π1(X /Γ). It follows that there is a homotopy equivalence X/Γ X /Γ which can be lifted to a map f : X X . This map f can then be shown to be a quasi-isometry. Recall that a (not necess...
We consider the Knapsack Covering problem subject to a matroid constraint. In this problem, we are given an universe U of n items where item i has attributes: a cost c(i) and a size s(i). We also have a demand D. We are also given a matroid M = (U, I) on the set U . A feasible solution S to the problem is one such that (i) the cumulative size of the items chosen is at least D, and (ii) the set ...
We present approximation algorithms with O(n) processing time for the minimum vertex and edge guard problems in simple polygons. It is improved from previous O(n) time algorithms of Ghosh. For simple polygon, there are O(n) visibility regions, thus any approximation algorithm for the set covering problem with approximation ratio of log(n) can be used for the approximation of n vertex and edge g...
Let G be a finite Abelian group and D(G) its Davenport constant, which is defined as the maximal length of a minimal zero-sum sequence in G. We show that various problems on zero-sum sequences in G may be interpreted as certain covering problems. Using this approach we study the Davenport constant of groups of the form (Z/nZ)r , with n ≥ 2 and r ∈ N. For elementary p-groups G, we derive a resul...
In this paper we identify various inaccuracies in the paper by R. R. Saxena and S. R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (1997) 33-42. In particular, we observe that their algorithm does not guarantee optimality, contrary to what is claimed. Experimental analysis has been carried out to assess the value of this algorithm as a heuris...
We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state of the art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables ...
let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید