1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Reuven Bar Yehuda / rank
Normal rank
 
Property / author
 
Property / author: Reuven Bar Yehuda / 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.1016/j.dam.2017.01.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2588663527 / 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: Quadratic kernelization 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 complexity of minimum convex coloring / 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: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recoloring of paths / 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: Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:30, 16 July 2024

scientific article
Language Label Description Also known as
English
1.5-approximation algorithm for the 2-convex recoloring problem
scientific article

    Statements

    Identifiers