Flows on few paths: Algorithms and lower bounds (Q5487813): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
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.1002/net.20121 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1515075899 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hardness of the undirected congestion minimization problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4537731 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4471352 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New hardness results for congestion minimization and machine scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4828931 / rank | |||
Normal rank | |||
Latest revision as of 19:59, 24 June 2024
scientific article; zbMATH DE number 5052637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Flows on few paths: Algorithms and lower bounds |
scientific article; zbMATH DE number 5052637 |
Statements
Flows on few paths: Algorithms and lower bounds (English)
0 references
12 September 2006
0 references
multicommodity flow
0 references
network flow
0 references
unsplittable flow
0 references
\(k\)-splittable flow
0 references
approximation algorithm
0 references
randomized rounding
0 references
0 references
