We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...