A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem (Q3541080): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Maxim A. Babenko / rank
Normal rank
 
Property / author
 
Property / author: Maxim A. Babenko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1543005377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Path 2-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost multiflows in undirected networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results on node-capacitated packing of A-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:09, 28 June 2024

scientific article
Language Label Description Also known as
English
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
scientific article

    Statements

    Identifiers