Titlebook: Computing and Combinatorics; 25th International C Ding-Zhu Du,Zhenhua Duan,Cong Tian Conference proceedings 2019 Springer Nature Switzerlan

縮短

Functional

preeclampsia

An FPTAS for a General Class of Parametric Optimization Problems,is interested in computing a solution for each possible value of the parameter. For many important parametric optimization problems including the parametric versions of the shortest path problem, the assignment problem, and the minimum cost flow problem, however, the piecewise linear function mappin

Asseverate

Mystic

Diameter of Colorings Under Kempe Changes,t in the subgraph of . induced by the two color classes of . and ., and then swap the colors . and . in the component. Two .-colorings are called Kempe-equivalent if one can be transformed into the other by a sequence of Kempe-changes. We consider two problems, defined as follows: First, given two .

prosthesis

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line,d only if the corresponding rectangles in . . i.e. their boundaries intersect..In this article, assuming the . to be true we show that it is not possible to approximate the . (.) problem on rectangle overlap graphs with a factor . for any .. Previously only APX hardness was known for this problem du

Parley

irritation

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes,omorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. [.]. We consider three different variants of graph homomorphisms, namely ., . and . and obtain polynomial families complete for ., ., ., and . under each one of these. The polynomial families have the follow

粗魯?shù)娜?/a>

SPALL

Approximation Hardness of Travelling Salesman via Weighted Amplifiers,torial optimisation problems. In this paper we introduce the weighted amplifiers and weighted low occurrence of . problems as intermediate steps in the NP-hard gap reductions. Allowing the weights in intermediate problems is rather natural for the edge-weighted problems as . or .. We demonstrate the