Approximating minimum-cost connectivity problems via uncrossable bifamilies (Q2933629): 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.1145/2390176.2390177 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052656799 / rank | |||
Normal rank | |||
Latest revision as of 22:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating minimum-cost connectivity problems via uncrossable bifamilies |
scientific article |
Statements
Approximating minimum-cost connectivity problems via uncrossable bifamilies (English)
0 references
5 December 2014
0 references
approximation algorithms
0 references
graph connectivity
0 references
node-costs
0 references
rooted connectivity
0 references
