RNC-approximation algorithms for the steiner problem (Q5048954): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/bfb0023489 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1485792125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random pseudo-polynomial algorithms for exact matroid problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une heuristique pour le problème de l'arbre de Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting path algorithm for linear matroid parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:32, 30 July 2024

scientific article; zbMATH DE number 7614497
Language Label Description Also known as
English
RNC-approximation algorithms for the steiner problem
scientific article; zbMATH DE number 7614497

    Statements

    RNC-approximation algorithms for the steiner problem (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references