Titlebook: Combinatorial Optimization and Applications; 11th International C Xiaofeng Gao,Hongwei Du,Meng Han Conference proceedings 2017 Springer Int

Substance

Approximation Algorithms for the Generalized Stacker Crane Problem such that all arcs in a mixed graph . must be traversed at least once. In the real literature, since many different building materials must be handled, we consider the generalized stacker crane (GSC) problem, and the objective of this new problem is to determine a minimum weighted tour . traversing

萬神殿

易達到

A Local Search Approximation Algorithm for a Squared Metric ,-Facility Location Problemproblem (SMFLP) and .-facility location problem (.-FLP). In the SM-.-FLP, we are given a client set . and a facility set . from a metric space, a facility opening cost . for each ., and an integer .. The goal is to open a facility subset . with . and to connect each client to the nearest open facili

殺死

Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networksn spectrum sliced elastic optical path network. Improved algorithms with guaranteed performance ratios are provided for several NP-hard scenarios of the SA problem. Concretely, we develop .-approximation algorithms for the SA problem in chain networks with five or six nodes, and for the SA problem i

BRINK

Ceramic

Conflict-Free Connection Numbers of Line Graphswo distinct vertices of ., there is a conflict-free path connecting them. For a connected graph ., the . of ., denoted by .(.), is defined as the minimum number of colors that are required to make . conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connec

思想流動

The Coloring Reconfiguration Problem on Specific Graph Classes at all times maintaining a .-coloring, where . denotes the number of colors. This decision problem is known to be PSPACE-complete even for bipartite graphs and any fixed constant .. In this paper, we study the problem from the viewpoint of graph classes. We first show that the problem remains PSPAC

搖曳的微光

Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizese objective is to minimize the total completion time of all jobs. We show that the worst-case ratio of the algorithm based on the bin-packing algorithm First Fit Increasing (.) lies in the interval . for the single machine case, and is no more than . for the parallel machines case.

APNEA

生來