A better approximation algorithm for the budget prize collecting tree problem. (Q703233): 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.1016/j.orl.2003.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995327008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SONET edge‐partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:05, 7 June 2024

scientific article
Language Label Description Also known as
English
A better approximation algorithm for the budget prize collecting tree problem.
scientific article

    Statements

    A better approximation algorithm for the budget prize collecting tree problem. (English)
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Approximation algorithms
    0 references
    subtree
    0 references
    0 references