Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths (Q2464225)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths |
scientific article |
Statements
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths (English)
0 references
10 December 2007
0 references
network
0 references
flow
0 references
path
0 references
heuristics
0 references
