On integer network synthesis problem with tree-metric cost (Q3121495): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Multi-Terminal Network Flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ON HALF-INTEGRALITY OF NETWORK SYNTHESIS PROBLEM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3085455 / 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 Reduction Method for Edge-Connectivity in Graphs / rank | |||
Normal rank | |||
Latest revision as of 19:27, 18 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On integer network synthesis problem with tree-metric cost |
scientific article |
Statements
On integer network synthesis problem with tree-metric cost (English)
0 references
18 March 2019
0 references
combinatorial optimization
0 references
network synthesis problem
0 references
tree metric
0 references
polynomial time algorithm
0 references
splitting-off
0 references
