Work

Theoretical Approaches to Node Assignment

Year: 2018
Type: article
Abstract: 1 Abstract In this paper, we provide a survey and explanation of several methods for approximating the NP-hard problem of finding a multiway separator in a graph. This is motivated by the problem of assigning nodes in an ethernet switch connected testbed without violating bandwidth constraints. As a critical component of the multiway separator problem, we discuss in some detail the sparse cut problem, with several modern O(log k) approaches, which result in realizable O(log 2 k) approximations to the multiway separator problem, and some even better theoretical bounds. Finally, we conclude with a less formal discussion of the mapping of the more general typed-nodes testbed problem to the multiway separator problem.
Language: English
Open Access status: green
OpenAlex ID: W798248036
FWCI: 9.831
Cites:
Cited by: 277
Related to: 10