A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
Abstract
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The problems are relevant for assessing network reliability and improving the network's performance and fault tolerance. The main technique considered in this paper is dynamic programming.
Cite
@article{arxiv.0806.0840,
title = {A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth},
author = {Mugurel Ionut Andreica},
journal= {arXiv preprint arXiv:0806.0840},
year = {2012}
}
Comments
Some of the ideas presented in this paper were later used by the author for preparing algorithmic tasks for several contests where the author was a member of the scientific committee (e.g. ACM ICPC Southeastern regional contest 2009 and Balkan olympiad in informatics 2011). Such tasks (including the task statement and solutions) can be found in the attached zip archive; THETA 16 / AQTR, Cluj-Napoca : Romania (2008)