Results 41 to 50 of about 925,039 (306)
Anticipated climate and land-cover changes reveal refuge areas for Borneo's orang-utans [PDF]
, 2015 Habitat loss and climate change pose a double jeopardy for many threatened taxa, making the identification of optimal habitat for the future a conservation priority.
Fischer, M. +30 more
core +1 more source
Weighted geometric set multi-cover via quasi-uniform sampling
Journal of Computational Geometry, 2016 We give a randomized polynomial time algorithm with approximation ratio $O(\log \phi(n))$ for weighted set multi-cover instances with a shallow cell complexity of at most $f(z,k) =z\phi(z) k^{O(1)}$.
Nikhil Bansal, Kirk Pruhs
doaj +1 more source
Edge Dominating Sets and Vertex Covers
Discussiones Mathematicae Graph Theory, 2013 Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj +1 more source
REDUNET: reducing test suites by integrating set cover and network-based optimization
Applied Network Science, 2020 The availability of effective test suites is critical for the development and maintenance of reliable software systems. To increase test effectiveness, software developers tend to employ larger and larger test suites.
Misael Mongiovì +2 more
doaj +1 more source
Land, 2023 Land take and soil sealing imply land cover transitions that may possibly result in decreased capacity to resist landslides; hence, this study focuses on the relations between land-taking processes and landslide hazard by addressing the following ...
Federica Isola +3 more
doaj +1 more source
Incremental Updating Algorithm for Approximation Sets on Semi-Monolayer Cover Rough Sets [PDF]
Jisuanji gongcheng, 2022 A one-to-one mapping relationship exists between the semi-monolayer cover rough sets and the set-valued information system.When an object set in a set-valued information system is dynamically added or removed, the information unit that corresponds to the
WU Zhengjiang, ZHANG Yaning, ZHANG Zhen, MEI Qiuyu, YANG Tian
doaj +1 more source
, 2022 Python software for solving set-cover problem using different methods. Methods based on linear programming, greedy and genetic algorithms (src/set_cover/solvers/) are implemented.
Khodos Aleksandr
core +1 more source
Approximation hardness of dominating set problems in bounded degree graphs
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover [PDF]
, 2007 In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay as little as possible.
Edith Elkind +5 more
core +1 more source
Set Covering with Our Eyes Closed [PDF]
SIAM Journal on Computing, 2008 Given a universe U of n elements and a weighted collection l of m subsets of U, the universal set cover problem is to a-priori map each element u epsi U to a set S(u) epsi l containing u, so that X sube U is covered by S(X)=UuepsiXS(u). The aim is finding a mapping such that the cost of S(X) is as close as possible to the optimal set-cover cost for X. (
Fabrizio Grandoni 0001 +5 more
openaire +5 more sources