Results 31 to 40 of about 282,015 (284)
Parameterized Streaming: Maximal Matching and Vertex Cover [PDF]
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams.
Chitnis, Rajesh +3 more
openaire +2 more sources
Developing a Two Objectives Model for Maximal Covering Problem Considering Queuing Parameters [PDF]
Maximal Covering Location Problem (MCLP) aims at maximizing a population of customers which are located within a specified range of time or distance from some new servers which should be located. A number of extensions have been proposed for this problem,
Mehdi Seifbarghy +2 more
doaj
Maximal covering location problems on networks with regional demand [PDF]
Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite.
Blanquero Bravo, Rafael +2 more
core +2 more sources
Locating using Geographical Information System and Weighted Maximal Covering Model [PDF]
At the present time, firms especially banks and finance and credit institutions to compete in the business world are seeking for maximal customer covering, reducing costs and increasing profit and efficiency.
Ali Mohaghar, Sara Ariaee
doaj
Minimal Stable Sets in Tournaments
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets.
Arrow +31 more
core +3 more sources
On Some Types of Covering-Based ℐ,T-Fuzzy Rough Sets and Their Applications
The notions of the fuzzy β-minimal and maximal descriptions were established by Yang et al. (Yang and Hu, 2016 and 2019). Recently, Zhang et al. (Zhang et al.
Mohammed Atef +3 more
doaj +1 more source
Statistical Mechanics of maximal independent sets
The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering ...
A. Galeotti +20 more
core +1 more source
The multimode covering location problem [PDF]
In this paper we introduce the Multimode Covering Location Problem. This is a generalization of the Maximal Covering Location Problem that consists in locating a given number of facilities of different types with a limitation on the number of facilities ...
Colombo, Fabio +2 more
core +2 more sources
Maximal 0-1-fillings of moon polyominoes with restricted chain lengths and rc-graphs [PDF]
We show that maximal 0-1-fillings of moon polynomials, with restricted chain lengths, can be identified with certain rc-graphs, also known as pipe dreams.
Martin Rubey
doaj +1 more source
A ratio ergodic theorem for multiparameter non-singular actions
We prove a ratio ergodic theorem for non-singular free $Z^d$ and $R^d$ actions, along balls in an arbitrary norm. Using a Chacon-Ornstein type lemma the proof is reduced to a statement about the amount of mass of a probability measure that can ...
Hochman, Michael
core +2 more sources

