Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CORR
2008
Springer

favoriteEmaildiscussreport

150views Education» more CORR 2008»

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

13 years 4 months ago

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

Download www.optimization-online.org

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.

Mugurel Ionut Andreica

Real-time Traffic

Algorithmic Framework | Combinatorial Optimization Problems | CORR 2008 | Education | Linear Time |

claim paper

Related Content

» A New Framework for Approximate Labeling via Graph Cuts

» Bucket Elimination A Unifying Framework for Reasoning

» Complexity and exact algorithms for vertex multicut in interval and bounded treewidth grap...

» Using Constraint Programming to Solve the Maximum Clique Problem

» Using Bound Sets in Multiobjective Optimization Application to the Biobjective Binary Knap...

» PAClearning Bounded Treewidth Graphical Models

» Approximate Labeling via Graph Cuts Based on Linear Programming

» MBDPOP A New MemoryBounded Algorithm for Distributed Optimization

» Finding an Optimal Path without Growing the Tree

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Mugurel Ionut Andreica

Comments (0)