Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1096543
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Nelson F. Maculan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / rank
 
Normal rank
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.1007/s10287-009-0116-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083790738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal spanning trees with a constraint on the number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum-leaf spanning tree problem: Formulations and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:23, 3 July 2024

scientific article
Language Label Description Also known as
English
Reformulations and solution algorithms for the maximum leaf spanning tree problem
scientific article

    Statements

    Reformulations and solution algorithms for the maximum leaf spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    20 September 2010
    0 references

    Identifiers