On bicriterion minimal spanning trees: An approximation (Q1360130): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree problems with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Needed: An Empirical Science of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive procedure using domination cones for bicriterion shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872513 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(96)00026-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046984978 / rank
 
Normal rank

Latest revision as of 08:28, 30 July 2024

scientific article
Language Label Description Also known as
English
On bicriterion minimal spanning trees: An approximation
scientific article

    Statements

    On bicriterion minimal spanning trees: An approximation (English)
    0 references
    0 references
    0 references
    0 references
    15 July 1997
    0 references
    set of efficient spanning trees
    0 references
    heuristics
    0 references
    neighbourhood search
    0 references
    adjacent search
    0 references

    Identifiers