Improved approximation for fractionally subadditive network design (Q2011025): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2019.105861 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2981213705 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5111735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved approximation algorithm for requirement cut / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expander graphs and their applications / rank | |||
Normal rank | |||
Revision as of 03:05, 21 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation for fractionally subadditive network design |
scientific article |
Statements
Improved approximation for fractionally subadditive network design (English)
0 references
28 November 2019
0 references
flow
0 references
approximation algorithms
0 references
network design
0 references
