Amanote Research
Register
Sign In
Centralized and Distributed Approximation Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
doi 10.1109/hpsr.2005.1503244
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
M. Allalouf
Y. Shavitt
Publisher
IEEE
Related search
Price-Based Max-Min Fair Rate Allocation in Wireless Multi-Hop Networks
Fair and Efficient Dynamic Bandwidth Allocation for Multi-Application Networks
Computer Networks
Computer Networks
Communications
Approximation Schemes for the Min-Max Starting Time Problem
Acta Informatica
Computer Networks
Software
Information Systems
Communications
Distributed Algorithms for Routing and String Recognition.
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
INFORMS Journal on Computing
Management Science
Computer Science Applications
Information Systems
Operations Research
Software
Global Routing Based on Steiner Min-Max Trees
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Electrical
Software
Computer Graphics
Computer-Aided Design
Electronic Engineering
Bandwidth Allocation and Routing Information for Wireless Mobile Ad-Hoc Networks
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms
