A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.orl.2003.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024840331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact arborescences, matchings and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-parameter graph optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Minimum Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix tree theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple efficient approximation scheme for the restricted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant: Old Algorithms, New Insights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank

Latest revision as of 16:00, 6 June 2024

scientific article
Language Label Description Also known as
English
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
scientific article

    Statements

    A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2004
    0 references
    0 references
    Spanning tree
    0 references
    Bicriteria approximation
    0 references
    Fully polynomial approximation scheme
    0 references
    Matrix-tree theorem
    0 references
    0 references