An extended formulation of the convex recoloring problem on a tree (Q1675254): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
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/s10107-016-1094-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2557978323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithm for convex recoloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Solving or Approximating Convex Recoloring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex recoloring problem: polyhedra, facets and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for the \(A\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Coloring Completion for General Graphs: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph polytopes and independence polytopes of count matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Recoloring Revisited: Complexity and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimum convex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recoloring of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of convex recolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recolorings of strings and trees: Definitions, hardness results and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial convex recolorings of trees and galled networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On imposing connectivity constraints in integer programs / rank
 
Normal rank

Latest revision as of 15:58, 14 July 2024

scientific article
Language Label Description Also known as
English
An extended formulation of the convex recoloring problem on a tree
scientific article

    Statements

    An extended formulation of the convex recoloring problem on a tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex recoloring problem
    0 references
    phylogenetic trees
    0 references
    0 references