APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385038): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.15807/jorsj.50.339 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W655233204 / rank | |||
Normal rank | |||
Latest revision as of 19:27, 19 March 2024
scientific article; zbMATH DE number 5269117
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) |
scientific article; zbMATH DE number 5269117 |
Statements
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (English)
0 references
29 April 2008
0 references
combinatorial optimization
0 references
approximation algorithm
0 references
degree bound
0 references
detachment
0 references
edge-connectivity
0 references
network design
0 references
splitting
0 references
