Amanote Research
Register
Sign In
An Approximation Algorithm for Minimizing Congestion in the Single-Source K-Splittable Flow
Research Journal of Mathematics and Computer Science
doi 10.28933/rjmcs-2017-11-1405
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2017
Authors
Unknown
Publisher
eSciPub LLC
Related search
Approximation Algorithm for the Kinetic Robust K-Center Problem
Computational Geometry: Theory and Applications
Control
Optimization
Geometry
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Topology
An Algorithm for the Quadratic Approximation
Journal of Computational and Applied Mathematics
Computational Mathematics
Applied Mathematics
A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time
An Algorithm for Minimizing the Mumford-Shah Functional
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Bursty Fluid Approximation of TCP for Modeling Internet Congestion at the Flow Level
Relay Placement for Minimizing Congestion in Wireless Backbone Networks
On Minimizing the Maximum Congestion for Weighted Hypergraph Embedding in a Cycle
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
