Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems-Reference-Cited by-同舟云学术

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems

Published: Issue: Volume: Page:490-501
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ponta Oriana,Hüffner Falk,Niedermeier Rolf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79228-4_43.pdf

Reference20 articles.

1. Texts in Algorithmics;E.H. Bachoore,2007

2. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theory of Computing Systems, (to appear, 2007)

3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proc. 39th STOC, pp. 67–74. ACM Press, New York (2007)

4. Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research 177(1), 102–115 (2007)

5. Bodlaender, H.L., Weyer, M.: Convex and connected recolorings of trees and graphs (unpublished manuscript, 2005)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. 1.5-approximation algorithm for the2-Convex Recoloring problem;Discrete Applied Mathematics;2018-09

2. An extended formulation of the convex recoloring problem on a tree;Mathematical Programming;2016-11-30

3. 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem;Lecture Notes in Computer Science;2016

4. The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles;Theoretical Computer Science;2015-10

5. The convex recoloring problem: polyhedra, facets and computational experiments;Mathematical Programming;2015-03-04