An improved approximation scheme for the Group Steiner Problem (Q2709886): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
label / en | label / en | ||
An improved approximation scheme for the Group Steiner Problem | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4763418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4228484 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4764186 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3140426 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for Steiner trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A faster approximation algorithm for the Steiner tree problem in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/1097-0037(200101)37:1<8::aid-net2>3.0.co;2-r / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1986201860 / rank | |||
Normal rank | |||
Property / title | |||
An improved approximation scheme for the Group Steiner Problem (English) | |||
Property / title: An improved approximation scheme for the Group Steiner Problem (English) / rank | |||
Normal rank |
Latest revision as of 11:27, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved approximation scheme for the Group Steiner Problem |
scientific article |
Statements
17 April 2001
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
Steiner trees
0 references
graph algorithms
0 references
arborescences
0 references
group Steiner problem
0 references
An improved approximation scheme for the Group Steiner Problem (English)
0 references