Approximating Capacitated Tree-Routings in Networks (Q5425447): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_31 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1559701296 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:32, 19 March 2024
scientific article; zbMATH DE number 5211383
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Capacitated Tree-Routings in Networks |
scientific article; zbMATH DE number 5211383 |
Statements
Approximating Capacitated Tree-Routings in Networks (English)
0 references
13 November 2007
0 references
Approximation Algorithm
0 references
Graph Algorithm
0 references
Routing Problems
0 references
Network Optimization
0 references
Tree Cover
0 references
