44 citations · 213 across the 38 of their papers we have counts for
6 papers · 1 filter
Optimizing Bivariate Partial Information Decomposition
Abdullah Makkeh, Dirk Oliver Theis
None of the BROJA information decomposition measures $\mbox{SI}, \mbox{CI}, \mbox{UIy}, \mbox{UIz}$ are convex or concave over the probability simplex. In this paper, we provide fo…
BROJA-2PID: A robust estimator for bivariate partial information decomposition
Abdullah Makkeh, Dirk Oliver Theis, Raul Vicente
Makkeh, Theis, and Vicente found in [8] that Cone Programming model is the most robust to compute the Bertschinger et al. partial information decompostion (BROJA PID) measure [1].…
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
The Steiner Traveling Salesman Problem (STSP) is a variant of the Traveling Salesman Problem (TSP) that is particularly suitable when dealing with sparse networks, such as road net…
The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract)
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità +1
The symmetric Virtual Private Network Design (VPND) problem is concerned with buying capacity on links (edges) in a communication network such that certain traffic demands can be m…
The VPN Tree Routing Conjecture for Outerplanar Networks
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità +1
The VPN Tree Routing Conjecture is a conjecture about the Virtual Private Network Design problem. It states that the symmetric version of the problem always has an optimum solution…
Odd minimum cut sets and b-matchings revisited
Adam N. Letchford, Dirk Oliver Theis
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time…