[PDF] Top 20 The probabilistic minimum vertex covering problem
Has 10000 "The probabilistic minimum vertex covering problem" found on our website. Below are the top 20 most common "The probabilistic minimum vertex covering problem".
The probabilistic minimum vertex covering problem
... graphe The probabilisti minimum vertex overing problem Abstra t An instan e of the probabilisti vertex- overing problem is a pair (G = (V, E), Pr) ob- tained by asso ... Voir le document complet
16
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
... of the most interesting theoretical problems in the complexity theory is to be able to “transfer” approximation results (positive, negative, or conditional) from an NP-complete problem to another via ... Voir le document complet
12
Efficient algorithms for the Max k-Vertex Cover problem
... In the max k-vertex cover problem a graph G(V, E) with |V | = n vertices 1, ...n. The goal is to find a subset K ⊂ V with cardinality k, that is |K| = k, such that the total number of ... Voir le document complet
14
On the probabilistic min spanning tree problem
... on the anticipatory solution S. Seen in this way, the probabilistic version probabilistic Π of a (deterministic) combinatorial optimization problem Π becomes another equally ... Voir le document complet
28
Covering design problem constructed by using the TS-CD algorithm
... A (v, k, t)-covering design is a collection of k-subsets (called blocks) of a v-set V such that every t-subset of V is contained in at least one block. Given v, k and t, the goal of the ... Voir le document complet
17
On the Minimum Hitting Set of Bundles Problem
... is the maximum number of bundles per set and M is the maximum number of sets an element can appear ...speaking the best approximation ratio that we can obtain since, by reducing mhsb to the ... Voir le document complet
14
Probabilistic models for the Steiner Tree problem
... minimization problem: E ∗ (G) 6 E (G, S ∗ , M) (3) In this paper, we mainly study the approximation of two probabilistic models for steiner tree derived by two modifications ...for ... Voir le document complet
19
On computing the minimum 3-path vertex cover and dissociation number of graphs
... this problem; we omit the ...step, the algorithm reduces the number of vertices of the graph, or increases the size of ...X. The algorithm is shown on the following ... Voir le document complet
14
Advanced metaheuristics for the probabilistic orienteering problem
... in the cluster are served. The probabilistic variations of the OP are mainly considering uncertainty on time and /or ...From the objective perspective, the POP we study in this ... Voir le document complet
120
Fast Reoptimization for the Minimum Spanning Tree Problem
... by the length of the longest path L max inside a deleted component (for instance, |L max | = 2 if all deleted nodes are not adjacent in T ∗ ...a covering. But, as we have already mentioned, such a ... Voir le document complet
21
Complexity Dichotomies for the Minimum F-Overlay Problem
... so the instance is ...solve the problem in time O ∗ (g(k) O(k) ) ...F}, the function f defined by f(n) = 0 for n ≤ N and f(n) = n otherwise satisfies the condition of Theorem 9, and so ... Voir le document complet
20
Improved worst-case complexity for the MIN 3-SET COVERING problem
... [3] J. Chen, L Liu, and W. Jia. Improvement on vertex cover for low-degree graphs. Networks, 35:253–259, 2000. [4] F. Della Croce and V. Th. Paschos. Computing optimal solutions for the min 3-set cover- ing ... Voir le document complet
7
Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science
... 2, the above mentioned theorem from [6] is false, and consequently both those algorithms are invalid for the general MBL ...Problem. The paper is organized as follows. In Section 2, we point ... Voir le document complet
23
A new efficient RLF-like algorithm for the vertex coloring problem
... while the best coloring produced by A-RLF-n for this instance contains 4 additional ...On the opposite, the best coloring produced by B-RLF-n for wap03 has 51 colors, while colorings with only 47 ... Voir le document complet
17
A Novel Approach for Probabilistic Photovoltaic Power Forecasting Covering Multiple Time Frames
... in the upcoming production of photo- voltaic (PV) plants is a challenge for grid operations and also a source of revenue loss for PV plant operators participating in electricity markets, since they have to pay ... Voir le document complet
9
Complexity Dichotomies for the Minimum $F$-Overlay Problem
... refer the reader to [8] for any undefined ...edges. The order of a graph G is |V (G)|, while its size is ...G[S] the graph with vertex set S and edge set {uv ∈ E(G) | u, v ∈ ...isolated ... Voir le document complet
13
Minimum k-path vertex cover
... k-path vertex cover if every path of order k in G contains at least one vertex from ...ψk(G) the minimum cardinality of a k-path vertex cover in ...that the problem of ... Voir le document complet
16
A note on the Clustered Set Covering Problem
... Proof. The APX-completeness of SCP when ∆ and δ are upper bounded by constants (for instance, when ∆ = 3 and δ = 2) is known from ...Hence, the result follows from Theorem 2. Before introducing in section 4 ... Voir le document complet
9
The probabilistic k-center problem
... Our problem is a particular case of location-allocation ...only the location of emergency assembly points, defined as a subset K ⊆ V, |K| = k and known as a k-center (location problem), but it also ... Voir le document complet
13
Aggregation Approach for the Minimum Binary Cost Tension Problem
... in the same series, some instances are easier to solve. If we look at the number of cases generated by the aggregation, there is also a significant variation among the instances of a same ... Voir le document complet
15
Sujets connexes