We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
— Several recently-designed robots are able to scale steep surfaces using animal-inspired strategies for foot attachment and leg kinematics. These designs could be valuable for r...
Kathryn A. Daltorio, Timothy C. Witushynsky, Grego...
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...
Scale-out approach, in contrast to scale-up approach (exploring increasing performance by utilizing more powerful shared-memory servers), refers to deployment of applications on a...
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...