找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization and Applications; 6th International Co Guohui Lin Conference proceedings 2012 Springer-Verlag Berlin Heidelberg

[复制链接]
楼主: angiotensin-I
发表于 2025-3-23 13:27:04 | 显示全部楼层
The ,-Matching Problem in Hypergraphs: Hardness and Approximability, .. This result generalizes a result of Kann from . = 1 to the case that . ∈ ℕ with .. Furthermore, we extend a result of Srivastav and Stangier, who gave an approximation algorithm for the unweighted .-matching problem.
发表于 2025-3-23 17:10:24 | 显示全部楼层
Resource Scheduling with Supply Constraint and Linear Cost,blem is NP-hard when . is the input of the problem. We then give a simple greedy algorithm with 2-approximation ratio. Finally, we present a polynomial time algorithm with complexity .(..) to solve this problem when the number of different resources requirements that are not multiples of . is at most ..
发表于 2025-3-23 18:59:42 | 显示全部楼层
发表于 2025-3-23 23:36:26 | 显示全部楼层
Gökçen Firdevs Yücel Caymaz,Kürşat Kemal Kulgive examples showing that |.(.) − .(..)| can be arbitrarily large. Further, we characterize permutation graphs .. satisfying .(..) = . for a graph . that is a nearly complete graph, a complete .-partite graph, a cycle, and a path, respectively, on . vertices.
发表于 2025-3-24 04:34:08 | 显示全部楼层
发表于 2025-3-24 06:42:18 | 显示全部楼层
发表于 2025-3-24 14:45:12 | 显示全部楼层
Conference proceedings 2012 revised papers including one invited talk and one keynote talk were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest.
发表于 2025-3-24 17:06:02 | 显示全部楼层
0302-9743 were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest.978-3-642-31769-9978-3-642-31770-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-24 22:13:20 | 显示全部楼层
Anindita Sarkar Mondal,Samiran Chattopadhyayt the number of Hamiltonian paths starting at a single vertex in . is the maximum over all possible outerplanar graphs with . vertices. Finally, we prove a 2.2134. upper bound on the number of Hamiltonian cycles in planar graphs, which improves the previously best known upper bound 2.3404..
发表于 2025-3-25 01:59:05 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-13 14:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表