scientific article; zbMATH DE number 7765399

DOI10.4230/LIPICS.ISAAC.2020.41MaRDI QIDQ6087213zbMATH OpenFDO

Authors N. Kumar

Publication date 14 November 2023

Full work available at URL https://arxiv.org/abs/2007.01280

zbMATH Keywords

combinatorial optimizationmulticommodity flownetwork design

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A face cover perspective to ℓ₁ embeddings of planar graphs
• Cuts, trees and \(\ell_1\)-embeddings of graphs
• Embedding k-Outerplanar Graphs into l1
• Flow-Cut Gaps and Face Covers in Planar Graphs
• Flow-cut gaps for integer and fractional multiflows
• Multicommodity flows in planar graphs
• On a routing problem
• On Odd Cuts and Plane Multicommodity Flows
• The geometry of graphs and some of its algorithmic applications

Cited in

(1)

• An approximate generalization of the Okamura-Seymour theorem

This page was built for publication:

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