Convex Combinations of Single Source Unsplittable Flows

DOI10.1007/978-3-540-75520-3_36MaRDI QIDQ3527229zbMATH OpenOpenAlexFDO

Authors Maren Martens, F. Salazar, Martin Skutella

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_36

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Single source unsplittable flows with arc-wise lower and upper bounds
• Single source unsplittable flows with arc-wise lower and upper bounds
• On the single-source unsplittable flow problem
• Stochastic unsplittable flows
• Convex generalized flows
• Approximation algorithms for single-source unsplittable flow
• On the approximation of the single source \(k\)-splittable flow problem
• Variational, Geometric, and Level Set Methods in Computer Vision
• Some results on the convex combination of uninorms
• Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems

Cited in

(9)

• Single-source \(k\)-splittable min-cost flows
• Single source unsplittable flows with arc-wise lower and upper bounds
• The splittable flow arc set with capacity and minimum load constraints
• A note on the ring loading problem
• Single source unsplittable flows with arc-wise lower and upper bounds
• An improved upper bound for the ring loading problem
• Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks
• Integer and unsplittable multiflows in series-parallel digraphs
• Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024

This page was built for publication: Convex Combinations of Single Source Unsplittable Flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527229)