Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Abbass Gorgi"'
Publikováno v:
Theoretical Computer Science. 845:136-143
For a given b ∈ N n and a hypergraph H = ( V , E ) with maximum degree Δ, the b-set multicover problem which we are concerned with in this paper may be stated as follows: find a minimum cardinality subset C ⊆ E such that no vertex v i ∈ V is c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06ee9dd4b6875c69a024fffc7c01f477
https://doi.org/10.1016/j.tcs.2020.09.009
https://doi.org/10.1016/j.tcs.2020.09.009
Let $$\mathcal {H}=(V,\mathcal {E})$$ be a hypergraph with maximum edge size $$\ell $$ and maximum degree $$\varDelta $$ . For a given positive integers $$b_v$$ , $$v\in V$$ , a set multicover in $$\mathcal {H}$$ is a set of edges $$C \subseteq \math
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::430a247ecc12a240a53ae40f4576da78
Publikováno v:
Proceedings of the Fourth International Conference on Engineering & MIS 2018.
In this paper we analyze the minimum cardinality PARTIAL SET b-MULTICOVER problem in uniform and regular hypergraphs. The problem is defined as follows: Let k ϵ ≥1, b ≥ 2 and a hypergraph H = (V,E) with maximum vertex degree Δ and maximum edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eefe1ceddad62434d3a7bc04c463626c
https://doi.org/10.1145/3234698.3234772
https://doi.org/10.1145/3234698.3234772