Approximating directed weighted-degree constrained networks
نویسندگان
چکیده
منابع مشابه
Approximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F ) with edge weights {we : e ∈ F}, the weighted degree of a node v in H is ∑ {wvu : vu ∈ F}. We give bicriteria approximation algorithms for problems that seek to find a minimum cost directed graph that satisfies both intersecting supermodular connectivity requirements and weighted degree constraints. The input to such problems is a directed graph G = (V,E) with edge-cost...
متن کاملApproximating Upper Degree-Constrained Partial Orientations
In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph G = (V,E), together with two degree constraint functions d−, d : V → N. The goal is to orient as many edges as possible, in such a way that for each vertex v ∈ V the number of arcs entering v is at most d−(v), whereas the number of arcs leaving v is at most d(v). This problem was introduced by Gabow [SO...
متن کاملApproximating Transitivity in Directed Networks
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set D ⊂ E and require that a valid solution A satisfies D ⊂ A (it is sometimes called transitive reduction problem). In the second extension (called p-ary trans...
متن کاملApproximating Transitive Reductions for Directed Networks
We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological and social network applications. We provide 3 2 -approximation algorithms for all the minimization problems and 2-approximation algorithms for all the maximization problems using appropriate primal-dual polytopes. We also show lo...
متن کاملConstrained Randomisation of Weighted Networks
We propose a Markov chain method to efficiently generate surrogate networks that are random under the constraint of given vertex strengths. With these strength-preserving surrogates and with edge-weight-preserving surrogates we investigate the clustering coefficient and the average shortest path length of functional networks of the human brain as well as of the International Trade Networks. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.11.043