منابع مشابه
Approximating power by weights
Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights, which is very beneficial for both theoretical considerations and practical computations with many members. We present quantitative approximation results with p...
متن کاملApproximating Steiner Networks with Node Weights
The (undirected) Steiner Network problem is as follows: given a graphG = (V, E) with edge/node-weights and edge-connectivity requirements {r(u, v) : u, v ∈ U ⊆ V }, find a minimumweight subgraph H of G containing U so that the uv-edge-connectivity in H is at least r(u, v) for all u, v ∈ U . The seminal paper of Jain [Combinatorica, 21 (2001), pp. 39–60], and numerous papers preceding it, consid...
متن کاملApproximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are unequal in their power to affect the outcome of the game. Prior research on weighted voting games has explored power indices, which reflect how much “real power” a voter has. Although primarily used for voting games, thes...
متن کاملApproximating Minimum-Power k-Connectivity
The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is k-connected and the total power is minimum. We give a new very simple approximation algorithm for this problem that significantly improves the previously best known approximation ratios. Specifically, the approxima...
متن کاملApproximating Steiner trees in graphs with restricted weights
We analyze the approximation ratio of the average distance heuristic for the Steiner tree problem on graphs, and prove nearly tight bounds for the cases of complete graphs with binary weights f1; dg, or weights in the interval 1; d], where d 2. The improvement over other analyzed algorithms is a factor of about e 2:718.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2018
ISSN: 1556-5068
DOI: 10.2139/ssrn.3116421