A stronger lower bound on parametric minimum spanning trees (Q6103526): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114229320, #quickstatements; #temporary_batch_1717959530040
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-022-01024-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162222637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network pricing problem with unit toll / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase algorithms for the parametric shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for planar \(k\)-sets and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Solution for Linear Bicriteria Knapsack Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric lower bounds for parametric matroid optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametric Closure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for parametric minimum spanning tree problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for the parametric knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural and algorithmic properties for parametric minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric optimization of sequence alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Classes of Two-Parameter Objectives Over Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for the parametric knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on computing peaks in k-levels and parametric spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point sets with many \(k\)-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:26, 1 August 2024

scientific article; zbMATH DE number 7691820
Language Label Description Also known as
English
A stronger lower bound on parametric minimum spanning trees
scientific article; zbMATH DE number 7691820

    Statements

    A stronger lower bound on parametric minimum spanning trees (English)
    0 references
    0 references
    0 references
    5 June 2023
    0 references
    parametric optimization
    0 references
    minimum spanning tree
    0 references
    parametric minimum spanning tree
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers