Optimal hierarchical decompositions for congestion minimization in networks
Author:
Open Access
- 17 May 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 255-264
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A Polylogarithmic Approximation of the Minimum BisectionSIAM Review, 2006
- Euclidean distortion and the sparsest cut2005
- Approximation Algorithms for Requirement Cut on GraphsLecture Notes in Computer Science, 2005
- Simultaneous Source LocationLecture Notes in Computer Science, 2004
- Optimal oblivious routing in polynomial time2003
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation AlgorithmSIAM Journal on Computing, 1998
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Competitive multicast routingWireless Networks, 1995