Polymatroid-based capacitated packing of branchings (Q2334055): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2019.06.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2954576846
@@ Property / OpenAlex ID: W2954576846 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid-Based Packing of Arborescences
@@ Property / cites work: Matroid-Based Packing of Arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization.
@@ Property / cites work: Submodular functions and optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Packing algorithms for arborescences (and spanning trees) in capacitated graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+Q4053708
@@ Property / cites work: Q4053708 / rank @@
+Normal rank
@@ Property / cites work @@
+Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / Wikidata QID @@
+Q127616999
@@ Property / Wikidata QID: Q127616999 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2334055