نتایج جستجو برای: robust coloring problem
تعداد نتایج: 1064111 فیلتر نتایج به سال:
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...
In this paper, mean absolute deviation model for optimal portfolio selection problem is studied. Due to the uncertainty in the observed returns from financial markets, an improved robust formulation based on Bertsimas and Sim approach is presented. Then we study the robust model of the problem under correlated uncertainty set and give its equivalent model. Finally, the performance of the imp...
Genetic programming (GP) is a novel paradigm that simulates the way of solving problems by nature according to Darwin's theory of fitness-driven natural selection. Instead of using bit strings as in genetic algorithm (GA), GP uses tree structures as its computing structures. As computer programs can be represented as trees, GP has been employed as a method of generating computer programs. In th...
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...
Graph coloring has numerous applications and is a wellknown NP-complete problem. The goal of this paper is to survey recent results of the authors on coloring and improper coloring of sparse graphs and to point out some polynomial-time algorithms for coloring (not necessarily optimal) of graphs with bounded maximum average degree. Mathematics Subject Classification: 05C15, 05C35
This paper explores the application of a new algebraic method of edge coloring, called complex coloring, to the scheduling problems of input queued switches. The proposed distributed parallel scheduling algorithm possesses two important features: optimality and rearrangeability. Optimality ensures that the algorithm always returns a proper coloring with the minimum number of required colors, an...
Abs t r ac t . In an edge-coloring of a graph G = (V, E) each color appears around each vertex at most once. An f-coloring is a generalization of an edge-coloring in which each color appears around each vertex v at most f(v) times where f is a function assigning a natural number f(v) e N to each vertex v E V. In this paper we first give a simple reduction of the f-coloring problem to the ordina...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید