We show the first non-trivial approximation factor for this problem by giving a polynomial time. O(log k)-approximation algorithm for graphs with treewidth k.

We show the first non-trivial approximation factor for this problem by giving a polynomial time O(log k)-approximation algorithm for graphs with treewidth k.

Abstract. We study a graph reordering problem motivated by compressing massive graphs such as social networks and inverted indexes. Given a graph, G = (V, E), ...

We show the first non-trivial approximation factor for this problem by giving a polynomial time ?(log k)-approximation algorithm for graphs with treewidth k.

1 day ago · This paper discusses the shortest path problem in a general directed graph with n nodes and K cost scenarios (objectives).

In the minimum linear arrangement (MLA) problem, one seeks a linear arrangement of minimum cost. This problem is known to be NP-complete.

In this talk, I will describe a log^{1+o(1)} n LP-based approximation for the problem. Based on joint work with Dor Katzelnik and Roy Schwartz.

Abstract. This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set.

May 24, 2024 · In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so ...

We analyze the approximability of this class of problems by providing polynomial bounded approximation for some special cases, and inapproximability results for ...