Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-013-9556-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022130029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree spanning tree problems: models and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Method for Solving Convex Finite Min-Max Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving the Lagrangian dual of integer programs via an incremental approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank

Latest revision as of 01:11, 7 July 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds for the spanning tree with minimum branch vertices
scientific article

    Statements

    Lower and upper bounds for the spanning tree with minimum branch vertices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    Lagrangian relaxation
    0 references
    dual ascent
    0 references
    0 references