• Aucun résultat trouvé

Minimum cost spanning tree situations

The P-value for cost sharing in minimum cost spanning tree situations

The P-value for cost sharing in minimum cost spanning tree situations

... of cost monotonic and population monotonic allocation rules (Sprumont (1990)) is ...mcst situations with the same ordering pattern of the edges with respect to ...for minimum spanning ...

16

Obligation rules for minimum cost spanning tree situations and their monotonicity properties

Obligation rules for minimum cost spanning tree situations and their monotonicity properties

... a minimum cost spanning tree ...the cost of connection can increase ...connection situations suitable to evolve with time, stability conditions satisfied for the original ...

19

The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects

The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects

... for minimum cost spanning tree situations, Working ...2004. Minimum cost spanning tree games and population monotonic allocation schemes, European Journal of ...

22

Connection situations under Uncertainty and Cost Monotonic Solutions

Connection situations under Uncertainty and Cost Monotonic Solutions

... cooperative cost games, minimum cost spanning tree situations, robustness, worst-case scenario, input interval data, ...total cost of connection is provided by a ...

22

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter

... Diameter- Tree problem, with special emphasis on its parameterized complexity for several choices of the ...(the cost of a solution), tw (the treewidth of the input graph), and ∆ (the maximum degree of the ...

13

Cost allocation protocols for network formation on connection situations

Cost allocation protocols for network formation on connection situations

... of minimum cost. However, it is easy to show that there is no cost allocation protocol which satisfies both IMON and OPT properties, implying that a large family of cost mono- tonic solution ...

8

Silent self-stabilizing scheme for spanning-tree-like constructions

Silent self-stabilizing scheme for spanning-tree-like constructions

... the system, and therefore also after a finite number of transient faults (such faults may corrupt the configuration of the system), provided that those faults do not alter the code of the processes. Among the vast ...

11

Production Cost Asymmetry, Minimum Access and Reciprocal Dumping

Production Cost Asymmetry, Minimum Access and Reciprocal Dumping

... Production cost asymmetry, minimum access and reciprocal dumping 1 Introduction Under the Uruguay Accord, non-tariff barriers (quotas) have been converted into tariff barriers in the agri-food ...a ...

33

Minimum Convex-Cost Tension Problems on Series-Parallel Graphs

Minimum Convex-Cost Tension Problems on Series-Parallel Graphs

... As explained in [9] and [17], such documents are composed of media objects (audio, video, text, image...), which duration of presentation must be adjusted to satisfy a set of temporal con- straints that express the ...

15

Minimum-Cost Virtual Network Function Resilience

Minimum-Cost Virtual Network Function Resilience

... 1 INTRODUCTION 1.1 Telecom context Network operators face the challenge of making their network more flexible and cost-effective. They also have to plan the evo- lution of their networks for the incoming 5G ...

7

The Radial Spanning Tree of a Poisson Point Process

The Radial Spanning Tree of a Poisson Point Process

... This tree has a local construction rule and a radial structure with the origin as its root We first use stochastic geometry arguments to analyze local functionals of the random tree such[r] ...

77

Brief announcement: Minimum spanning trees and cone-based topology control

Brief announcement: Minimum spanning trees and cone-based topology control

... Consider a set V of n nodes where kuvk is the distance from u to v and p(u, v) : V × V → R + is the minimum power required to reach node v from node u. The model assumes all nodes can transmit with the same ...

3

Minimum Reload Cost Graph Factors

Minimum Reload Cost Graph Factors

... • F ∩ E(J ) is the 4-cycle of J , and F \ E(J ) does not contain any edges incident to J . • F ∩ E(J ) is a triangle of J , F \ E(J ) contains exactly two edges incident to J both of which are incident its connecting ...

23

Laplacian matrices and spanning trees of tree graphs

Laplacian matrices and spanning trees of tree graphs

... The case of the adjacency matrix (another special case of Schr¨ odinger operator) was already studied by C. Athanasiadis who related the eigenvalues in the graph and in the tree graph (see [2], or Section 3.1). As ...

21

Étude des performances du Distributed Spanning Tree : un Overlay Network pour la Recherche de Services

Étude des performances du Distributed Spanning Tree : un Overlay Network pour la Recherche de Services

... 2. La structure des DST La structure du DST a été conçue pour palier aux problèmes de diffusion posés par les arbres et les graphes pseudo-aléatoires dans les réseaux de recouvrement à large échelle. L’idée de base est ...

13

Choquet-based optimisation in multiobjective shortest path and spanning tree problems

Choquet-based optimisation in multiobjective shortest path and spanning tree problems

... Abstract This paper is devoted to the search of Choquet-optimal solutions in finite graph problems with multiple objectives. The Choquet integral is one of the most sophisticated preference models used in decision theory ...

29

A linear programming approach to increasing the weight of all minimum spanning trees

A linear programming approach to increasing the weight of all minimum spanning trees

... AN LP APPROACH TO INCREASING THE WEIGHT OF MWSTS 13 Then these packings are combined to produce a packing of spanning trees in the original graph as described in the next subsection. This dual solu- tion ...

18

Approximation Algorithm for Minimum Cost Flow allocation with Varied Survivability

Approximation Algorithm for Minimum Cost Flow allocation with Varied Survivability

... ω p e , ∀e ∈ E). Hence ω q ≤ ω q  ≤ ζ k ∗ , which finally gives us that the weight ζ k of k = (p, q) verifies ζ k = ω p + ω q ≤ 2ζ k ∗ . However, we note that the output of Algorithm 1 is not a cycle! In fact, when ...

9

New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

... its tree-based representation) and finally compute a saliency map for visualization ...the tree-based rep- resentation of the ...a minimum spanning tree and explicitly computes the ...

13

On  the approximability of Minimum labeled spanning trees when each color appears at most r -times

On the approximability of Minimum labeled spanning trees when each color appears at most r -times

... Laboratoire d'Analyse et Modélisation de Systèmes pour l'Aide à la Décision CNRS UMR 7024.. On the approximability of Minimum labeled spanning trees when each color appears at most r -ti[r] ...

10

Show all 2810 documents...

Sujets connexes