Approximation and Online Algorithms
From MaRDI portal
Publication:5898463
DOI10.1007/11671411zbMATH Open1125.68427OpenAlexW4210634114MaRDI QIDQ5898463FDOQ5898463
Authors: Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz 
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Recommendations
- Improved approximation algorithm for convex recoloring of trees
- An extended formulation of the convex recoloring problem on a tree
- Approximation Algorithms for Path Coloring in Trees
- Quadratic Kernelization for Convex Recoloring of Trees
- Quadratic kernelization for convex recoloring of trees
- An Improved Approximation Bound for Spanning Star Forest and Color Saving
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
- Algorithms and Data Structures
- Column generation approach to the convex recoloring problem on a tree
- Convex Recoloring Revisited: Complexity and Exact Algorithms
Cited In (12)
- Algorithms and Data Structures
- Reconstruction for Colorings on Trees
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- Improved approximation algorithm for convex recoloring of trees
- The complexity of minimum convex coloring
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
- Convex recoloring of paths
- Convex recoloring of paths
- Efficient approximation of convex recolorings
- Partial convex recolorings of trees and galled networks
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
This page was built for publication: Approximation and Online Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898463)
