A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-009-0147-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966258309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of the undirected congestion minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the maximum concurrent \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of the single source \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hardness results for congestion minimization and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the single-source unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow deviation method: An approach to store‐and‐forward communication network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on multi-net global routing for integrated circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overtraining-resistant stochastic modeling method for pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-cost single-source 2-splittable flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows on few paths: Algorithms and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiterminal global routing: A deterministic approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the single source unsplittable min-cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank

Latest revision as of 10:50, 2 July 2024

scientific article
Language Label Description Also known as
English
A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
scientific article

    Statements

    A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    \(k\)-splittable flow
    0 references
    heuristic
    0 references
    maximum concurrent flow
    0 references
    multicommodity
    0 references
    throughput
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references