找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: CYNIC
发表于 2025-3-30 10:32:12 | 显示全部楼层
发表于 2025-3-30 16:22:30 | 显示全部楼层
发表于 2025-3-30 19:09:17 | 显示全部楼层
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
发表于 2025-3-31 00:37:49 | 显示全部楼层
发表于 2025-3-31 04:09:52 | 显示全部楼层
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 .
发表于 2025-3-31 07:54:05 | 显示全部楼层
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
发表于 2025-3-31 10:19:05 | 显示全部楼层
发表于 2025-3-31 15:01:18 | 显示全部楼层
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
发表于 2025-3-31 18:51:07 | 显示全部楼层
发表于 2025-3-31 23:11:57 | 显示全部楼层
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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-26 15:17
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表