找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Approximation Algorithms for Combinatorial Optimization; International Worksh Klaus Jansen,José Rolim Conference proceedings 1998 Springer-

[复制链接]
查看: 27932|回复: 58
发表于 2025-3-21 18:23:57 | 显示全部楼层 |阅读模式
期刊全称Approximation Algorithms for Combinatorial Optimization
期刊简称International Worksh
影响因子2023Klaus Jansen,José Rolim
视频video
发行地址Includes supplementary material:
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Approximation Algorithms for Combinatorial Optimization; International Worksh Klaus Jansen,José Rolim Conference proceedings 1998 Springer-
影响因子This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX‘98, held in conjunction with ICALP‘98 in Aalborg, Denmark, in July 1998..The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
Pindex Conference proceedings 1998
The information of publication is updating

书目名称Approximation Algorithms for Combinatorial Optimization影响因子(影响力)




书目名称Approximation Algorithms for Combinatorial Optimization影响因子(影响力)学科排名




书目名称Approximation Algorithms for Combinatorial Optimization网络公开度




书目名称Approximation Algorithms for Combinatorial Optimization网络公开度学科排名




书目名称Approximation Algorithms for Combinatorial Optimization被引频次




书目名称Approximation Algorithms for Combinatorial Optimization被引频次学科排名




书目名称Approximation Algorithms for Combinatorial Optimization年度引用




书目名称Approximation Algorithms for Combinatorial Optimization年度引用学科排名




书目名称Approximation Algorithms for Combinatorial Optimization读者反馈




书目名称Approximation Algorithms for Combinatorial Optimization读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:11:18 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160383.jpg
发表于 2025-3-22 03:02:50 | 显示全部楼层
Using linear programming in the design and analysis of approximation algorithms: Two illustrative pion in order to compute a near-optimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the uncapacitated facility location problem and the problem of scheduling precedence-constrained jobs on one machine so as to minimize a weighted average of their completion times.
发表于 2025-3-22 07:52:52 | 显示全部楼层
发表于 2025-3-22 12:48:30 | 显示全部楼层
A new fully polynomial approximation scheme for the knapsack problem,ary space requirements. The two best previously known approaches need .(. + 1/ɛ.) and .(.·l/ɛ) space, respectively. Our new approximation scheme requires only .(. + 1/ɛ.) space while also reducing the running time.
发表于 2025-3-22 16:17:40 | 显示全部楼层
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks,domized approximation algorithm for the arc colouring problem, an improvement over the best previously known performance ratio of 5/3. For the problem of allocating bandwidth in an all-optical . ring network, we present a factor-of-(1.5+1/2.+.(1)) randomized approximation algorithm, improving upon the best previously known performance ratio of 2.
发表于 2025-3-22 20:33:50 | 显示全部楼层
发表于 2025-3-22 22:32:13 | 显示全部楼层
发表于 2025-3-23 03:33:20 | 显示全部楼层
发表于 2025-3-23 09:24:19 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-26 03:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表