Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimum \((2,r)\)-metrics and integer multiflows

From MaRDI portal
Publication:1911842
Jump to:navigation, search

DOI10.1006/eujc.1996.0019zbMath0844.90028OpenAlexW2066777980MaRDI QIDQ1911842

Yannis Manoussakis, Alexander V. Karzanov

Publication date: 3 July 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0019


zbMATH Keywords

connected graphpolynomial timemulticommodity flow problem


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)


Related Items (7)

Hard cases of the multifacility location problem ⋮ One more well-solved case of the multifacility location problem ⋮ Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems ⋮ On return path packing. ⋮ Metrics with finite sets of primitive extensions ⋮ On one maximum multiflow problem and related metrics ⋮ On multiflow lexicographics




This page was built for publication: Minimum \((2,r)\)-metrics and integer multiflows

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1911842&oldid=14327020"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki