Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...