Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Integral packing of branchings in capacitaded digraphs

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

DOI10.1007/S10878-014-9768-3zbMATH Open1333.90109OpenAlexW2041392158MaRDI QIDQ5963635FDOQ5963635

Mario Leston-Rey

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9768-3



zbMATH Keywords

branchingpackingarborescences


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)


Cites Work

  • Combinatorial optimization. Polyhedra and efficiency (3 volumes)
  • Title not available (Why is that?)
  • On two minimax theorems in graph
  • Packing algorithms for arborescences (and spanning trees) in capacitated graphs


Cited In (1)

  • Stronger bounds and faster algorithms for packing in generalized kernel systems






This page was built for publication: Integral packing of branchings in capacitaded digraphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5963635&oldid=12140022"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 01:31. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki