The k-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing

by   Dehia Ait Ferhat, et al.

In this paper, we investigate the k-path coloring problem, a variant of vertex coloring arising in the context of integrated circuit manufacturing. In this setting, typical industrial instances exhibit a `tree-like' structure. We exploit this property to design an efficient algorithm for our industrial problem: (i) on the methodological side, we show that the k-path coloring problem can be solved in polynomial time on graphs with bounded treewidth and we devise a simple polytime dynamic programming algorithm in this case (not relying on Courcelle's celebrated theorem); and (ii) on the empirical side, we provide computational evidences that the corresponding algorithm could be suitable for practice, by testing our algorithm on true instances obtained from an on-going collaboration with Mentor Graphics. We finally compare this approach with integer programming on some pseudo-industrial instances. It suggests that dynamic programming cannot compete with integer programming when the tree-width is greater than three. While all our industrial instances exhibit such a small tree-width, this is not for granted that all future instances will also do, and this tend to advocate for integer programming approaches.


page 1

page 2

page 3

page 4


The generalized locally checkable problem in bounded treewidth graphs

We introduce a new problem that generalizes some previous attempts of co...

Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs

For graphs G and H, a homomorphism from G to H is an edge-preserving map...

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph

It is well known that the treewidth of a graph G corresponds to the node...

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem

We study the generalized minimum Manhattan network (GMMN) problem: given...

Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints

We consider the fair allocation of indivisible items to several agents w...

A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width

In this paper we study a scheduling problem arising from executing numer...

Please sign up or login with your details

Forgot password? Click here to reset