Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
— Semi-blind spatial equalisation is considered for multiple-input multiple-output (MIMO) systems that employ high-throughput quadrature amplitude modulation scheme. A minimum nu...
— We propose a semi-blind adaptive beamforming approach for wireless systems that employ high-throughput quadrature amplitude modulation signalling schemes. A minimum number of t...
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...