We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
Chan-Byoung Chae, Taiwen Tang, Robert W. Heath Jr....
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew...
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...