This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...