In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g 1−ε)-inapproximability even when G is a mesh. We ...
Abstract Let G be a undirected connected graph. Given g groups each being a subset of. V(G) and a number of colors, we consider how to find a subgroup of ...
In this section, we show that the Min-TRC problem is as hard as the vertex coloring problem, and then deduce the inapproximability results directly from Theorem ...
Let G be an undirected connected graph. Given a set of g groups each being a subset of V(G), the tree routing and coloring problem is to produce g trees in ...
Shuai, Inapproximability and approximability of maximal tree routing and coloring, Journal of Combinatorial Optimiza- tion 11 (2006) 219–229. [8] T ...
We first prove Ω(g1 ε)-inapproximability of the problem even when G is a mesh, and then we propose some approx- imation algorithms with provable performance ...
Aug 21, 2024 · Approximability and inapproximability are crucial concepts in combinatorial optimization. They help us tackle complex problems when finding ...
Abstract. The study of the path coloring problem is motivated by the allocation of optical bandwidth to communication requests in all-optical.
Missing: approximability | Show results with:approximability
Chen, X., Hu, X., and Shuai, T. 2006. Inapproximability and approximability of maximal tree routing and coloring. J. Combinat. Optim. 11, 2, 219--229.
Jul 27, 2004 · Johnson considers the problems Max SAT, Set Cover, Independent Set, and Coloring. 1 He notes that there is a 2-approximate algorithm for Max ...