The maximum \(f\)-depth spanning tree problem (Q1603381): 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: Approximate solution of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / 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: Completeness in approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential approximation algorithms for some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging gap between standard and differential polynomial approximation: The case of bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing reliable tree networks with two cable technologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating k-set cover and complementary graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00160-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019955382 / rank
 
Normal rank

Latest revision as of 09:17, 30 July 2024

scientific article
Language Label Description Also known as
English
The maximum \(f\)-depth spanning tree problem
scientific article

    Statements

    The maximum \(f\)-depth spanning tree problem (English)
    0 references
    14 July 2002
    0 references
    Approximate algorithms
    0 references
    Differential ratio
    0 references
    Performance ratio
    0 references
    Analysis of algorithms
    0 references
    Reductions
    0 references
    0 references

    Identifiers