找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: WALCOM: Algorithms and Computation; Third International Sandip Das,Ryuhei Uehara Conference proceedings 2009 Springer-Verlag Berlin Heidel

[复制链接]
楼主: ossicles
发表于 2025-3-30 11:53:07 | 显示全部楼层
发表于 2025-3-30 13:51:44 | 显示全部楼层
Network Design with Weighted Degree Constraintsto compute a minimum cost graph with a prescribed connectivity. We propose bi-criteria approximation algorithms based on the iterative rounding, which has been successfully applied to the degree-bounded network design problem. A problem minimizing the maximum weighted degree of vertices is also discussed.
发表于 2025-3-30 18:32:21 | 显示全部楼层
Network Design with Weighted Degree Constraintsto compute a minimum cost graph with a prescribed connectivity. We propose bi-criteria approximation algorithms based on the iterative rounding, which has been successfully applied to the degree-bounded network design problem. A problem minimizing the maximum weighted degree of vertices is also discussed.
发表于 2025-3-30 23:30:39 | 显示全部楼层
Conference proceedings 2009papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.
发表于 2025-3-31 04:02:20 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1020034.jpg
发表于 2025-3-31 06:29:23 | 显示全部楼层
发表于 2025-3-31 10:24:08 | 显示全部楼层
发表于 2025-3-31 16:28:46 | 显示全部楼层
发表于 2025-3-31 18:56:55 | 显示全部楼层
Foundations of Exact Roundingor exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.
发表于 2025-3-31 22:07:55 | 显示全部楼层
Foundations of Exact Roundingor exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 21:06
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表