Optimization Online


A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth

Mugurel Ionut Andreica(mugurelionut***at***gmail.com)

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.

Keywords: dynamic programming, bounded pathwidth, combinatorial optimization, partial grid graphs, framework

Category 1: Combinatorial Optimization (Graphs and Matroids )

Category 2: Other Topics (Dynamic Programming )

Category 3: Network Optimization

Citation: Proceedings of the IEEE International Conference on Automation, Quality and Testing, Robotics (THETA 16) (AQTR), Cluj-Napoca, Romania, 22-25 May, 2008. Poster.

Download: [PDF]

Entry Submitted: 05/20/2008
Entry Accepted: 05/20/2008
Entry Last Modified: 05/20/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society