We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
Mohammed El-Hajjar, Robert G. Maunder, Osamah Alam...
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...