[PDF] Top 20 Efficient determination of the k most vital edges for the minimum spanning tree problem
Has 10000 "Efficient determination of the k most vital edges for the minimum spanning tree problem" found on our website. Below are the top 20 most common "Efficient determination of the k most vital edges for the minimum spanning tree problem".
Efficient determination of the k most vital edges for the minimum spanning tree problem
... words: most vital edges, minimum spanning tree, exact algorithms, mixed integer ...involving the use of communication or transportation networks, we often need to ... Voir le document complet
15
On the probabilistic min spanning tree problem
... a minimum total edge-weight tree spanning V . min spanning tree is a celebrated problem, very frequently modeling several kinds of networks in transports, communications, ... Voir le document complet
28
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
... under the constraint that k edges can be deleted (called Max-Length ...SP-MVE). For an instance of SP-MVE or Max-Length SP-MVE we assume that k is smaller than the size ... Voir le document complet
17
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game
... where, for a given k = 2, . . . , K and blue edge f = {a, b}, P ab denotes any path that starts at a and ends at b in the graph G k−1 = ( V, B \ {f } ∪ {e ∈ R : c e ≤ c k−1 ... Voir le document complet
9
Complexity of determining the most vital elements for the 1-median and 1-center location problems
... The k most vital edges/nodes and min edge/node blocker versions have been studied for several problems, including shortest path, minimum spanning tree, ... Voir le document complet
15
Complexity Dichotomies for the Minimum $F$-Overlay Problem
... Notation Most notations of this paper are standard. We now recall some of them, and we refer the reader to [8] for any undefined ...terminology. For a graph G, we denote by V (G) ... Voir le document complet
13
The probabilistic minimum vertex covering problem
... that for every v i v j ∈ E either v i ∈ C , or v j ∈ C . The vertex- overing problem (VC) onsists in nding a vertex over of minimum ...generalization of VC, denoted by WVC in ... Voir le document complet
16
Selection of the most efficient wavelength bands for 'Jonagold' apple sorting
... method for finally computing reflectance ...filters for detection of apple defects. The reflectance spectra of normal and damaged surfaces were computed from the hyperspectral ... Voir le document complet
12
The auction algorithm for the minimum cost network flow problem
... To show that the number of substantive price rises per iteration is finite, note that with each substantive price rise, the reject capacity of either node i or a n[r] ... Voir le document complet
32
Optimality Conditions and Synthesis for the Minimum Time Problem
... by the Human Capital and Mobility Programme of the European Community through the network on Calculus of Variations and Control of Constrained Uncertain ... Voir le document complet
4
Aggregation Approach for the Minimum Binary Cost Tension Problem
... ), the tension data of any arc u that has been reversed must be modified as follows ...that the constraints and the objective functions of both problems are equiva- ...results ... Voir le document complet
15
On the Minimum Hitting Set of Bundles Problem
... Among the deterministic approximation algorithms that we considered, d2- rounding is clearly the best in terms of performance guarantee since N (1 − (1 − 1/N) M ) < min{N, M} (see inequality ... Voir le document complet
14
Complexity Dichotomies for the Minimum F-Overlay Problem
... Dichotomies for the Minimum F-Overlay Problem 7 ...regarding the polynomial vs. NP-hard status with respect to the considered family ...that the easy cases one can think ... Voir le document complet
20
Probabilistic models for the Steiner Tree problem
... steiner tree is well known to be NP-hard. The first approximation algorithm for it appeared in [1] (see also [11, ...generalization of the following simple heuristic: compute the ... Voir le document complet
19
Non-integrability of the minimum-time Kepler problem
... work of Ziglin in the 80’s [23], followed by the modern formu- lation of differential Galois theory in the late 90’s by Moralès, Ramis and Simó [14, 15], have led to a very diverse ... Voir le document complet
14
French Presidential Elections: What are the most Efficient Measures for Tweets?
... Actually the distribution of tweets over time can di↵er significantly, ...i.e. for some events lots of tweets can be sent in one day while sometimes the number of exchanged ... Voir le document complet
9
The K-moment problem for continuous linear functionals
... [3], the ℓ 1 -closure of Σ[x] is Psd([−1, 1] n ). On the other hand, its ℓ w -closure is now Psd(R n ), which is what we really ...not). The proof is the same. Any closed set K ⊂ ... Voir le document complet
20
A linear programming approach to increasing the weight of all minimum spanning trees
... May 2005 Cahier n° 2005-012 Résumé: Dans cet article nous étudions le problème qui consiste à augmenter au moindre coût le poids de tous les arbres couvrants de poids minimum. Nous considérons le cas où le coût ... Voir le document complet
18
Three Selfish Spanning Tree Games
... of an edge represents its length and the power needed to send a message to a remote node increases with the ...request. For the max sst-game, the weight of an edge ... Voir le document complet
18
The k-simultaneous consensus problem
... one of the processes) 1 ...version of the k-simultaneous consensus, where, each process proposes k possibly different values, one value to each of the k ... Voir le document complet
18
Sujets connexes