Some new results on node-capacitated packing of A-paths
From MaRDI portal
Publication:3549661
DOI10.1145/1250790.1250878zbMath1231.05216MaRDI QIDQ3549661
Publication date: 5 January 2009
Published in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1250790.1250878
polynomial time algorithm; maximum packing; Gerard's proximity lemma; node-capacitated A-path packing algorithm
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Min-cost multiflows in node-capacitated undirected networks, Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem