David G. Andersen December 23, 2002  Home/Search
Context
Related
| cmu.edu/~dga/paper...andersenassign.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~dga/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we provide a survey and explanation of several methods for approximating the NP-hard problem of nding 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 k) approximations to the... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ december-theoretical,
author = "David Andersen December",
title = "Theoretical Approaches to Node Assignment",
url = "citeseer.ist.psu.edu/751556.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.cs.cmu.edu/~dga/papers/index.html): More
Improving Web Availability for Clients with MONET - Andersen, Balakrishnan.. (2005) (Correct)
The Case for Resilient Overlay Networks - David Andersen Hari (2001) (Correct)
Block-Level Security for Network-Attached Disks - Aguilera, Ji, Lillibridge.. (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC