MINIMUM COST
The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects
... a minimum cost spanning ...this cost allocation ...the minimum cost spanning tree game (mcst game) when a minimum cost spanning tree is ...stable cost monotonic ...
22
Obligation rules for minimum cost spanning tree situations and their monotonicity properties
... Consider, for instance, a wireless telecommunication network where agents are operators of transmitters for traffic exchange and the source is the cen- tral hub station. Agents can decide to communicate directly with the ...
19
Approximation Algorithm for Minimum Cost Flow allocation with Varied Survivability
... allocation problem with varied survivability. Given a set of demands and a capacitated network, the problem consists of allocating each demand to a set of primary paths that carry the flows realizing the demand volume in ...
9
Minimum cost spanning tree games and population monotonic allocation schemes
... mum cost spanning tree games andmonotonic directedminimum cost span- ning tree games do not necessarily have a ...have cost 0 whereas all other directed arcs have cost ...directed ...
21
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks
... the minimum cost set of interfaces in such a way that all the edges of G are ...the minimum cost set of interfaces in G in order to guarantee a path of communica- tion between every pair of ...
10
Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum cost perfect matching algorithm
... SUMMARY A new indirect way of producing all-quad meshes is presented. The method takes advantage of a well known algorithm of the graph theory, namely the Blossom algorithm that computes the minimum cost ...
23
Coronary vein tracking from MSCT using a minimum cost path approach
... on minimum-cost path approaches which appear less sensitive to noise ...a cost function definition which assigns a value to each node in a graph representation of the ...specific cost function ...
5
The P-value for cost sharing in minimum cost spanning tree situations
... Key-words: Cost sharing, minimum cost spanning tree games, value, po- pulation monotonic allocation schemes. 1 Introduction Since the basic paper of Bird (1976) much attention has been paid to the ...
16
Coronary Vein Extraction in MSCT Volumes Using Minimum Cost Path and Geometrical Moments
... using Minimum Cost Path and Geometrical Moments ...a minimum cost path technique with a Fast-Marching front propagation to extract the vessel ...
10
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] ...
32
An auction/sequential shortest path algorithm for the minimum cost network flow problem
... By the theory of the auction/shortest path algorithm, a shortest path in the reduced graph will be found in a finite number of iterations if there exists at lea[r] ...
20
Minimum-Cost Virtual Network Function Resilience
... ABSTRACT In the future 5G networks, a wide range of new services with strong requirements will be delivered in the form of chains of service functions on independent virtual networks. These virtual networks will be ...
7
Minimum Convex-Cost Tension Problems on Series-Parallel Graphs
... the minimum cost tension problem, a SP-graph can be reduced to a single arc with a convex piecewise linear cost ...the minimum cost tension problem on the reduced graph with any known ...
15
Minimum Reload Cost Graph Factors
... with minimum cost can be solved in polynomial-time [ 25 ...reload cost counterpart was studied by Galbiati ...the minimum reload cost cycle cover problem is NP-hard even when the number ...
23
Minimum Convex Piecewise Linear Cost Tension Problem on Quasi-k Series-Parallel Graphs
... Keywords: minimum cost tension, series-parallel graph, graph decomposition, series-parallel ...tension minimum à coûts convexes linéaires par morceaux, ou CPLCT, sur des graphes série-parallèles) ...
21
A GRASP Heuristic for the Minimum Binary Cost Tension Problem
... This problem can be interpreted as a Minimum Cost Tension Problem (MCTP) in a graph. Let G = (N, A) be a digraph, where N is the set of nodes and A is the set of arcs, n = |N | and m = |A|. The nodes ...
4
Aggregation Approach for the Minimum Binary Cost Tension Problem
... subgraphs implied in the relation are known, and from them, it is possible to quickly build the optimal tension of the whole SP-relation. Hence, starting from the leaves of T , the optimal tension of each SP-relation is ...
15
Salaire minimum et bas revenus
... (Revenu minimum d’Insertion, Allocation de Parent Isolé, Allocations Familiales, Allocation Logement, Allocation de la Paje, Allocation de rentrée scolaire, impôt sur le revenu, Prime Pour l’Emploi, taxe ...
95
Minimum Size Tree-decompositions
... From Corollary 2.3 , solving the Minimum Size Tree-Decomposition prob- lem in a class of graphs C reduces to the problem of finding a k-potential-leaf for any graph G ∈ C. This can be done in polynomial time if ...
7
SALAIRE MINIMUM INTERPROFESSIONNEL DE CROISSANCE
... Le Groupe d’experts recommande de s’abstenir de tout coup de pouce sur le SMIC au premie r janvier 2021. Le SMIC évoluerait ainsi selon les seuls mécanismes de revalorisation automatiq ue, ce qui permettrait, selon les ...
227