找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: ossicles
51#
發(fā)表于 2025-3-30 11:53:07 | 只看該作者
52#
發(fā)表于 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.
53#
發(fā)表于 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.
54#
發(fā)表于 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.
55#
發(fā)表于 2025-3-31 04:02:20 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1020034.jpg
56#
發(fā)表于 2025-3-31 06:29:23 | 只看該作者
57#
發(fā)表于 2025-3-31 10:24:08 | 只看該作者
58#
發(fā)表于 2025-3-31 16:28:46 | 只看該作者
59#
發(fā)表于 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.
60#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 18:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
木里| 霍林郭勒市| 巴南区| 芷江| 河东区| 大冶市| 临安市| 隆尧县| 太保市| 武冈市| 霍林郭勒市| 金川县| 上栗县| 尼勒克县| 蒙自县| 曲阜市| 龙口市| 四子王旗| 贞丰县| 巴彦县| 镇巴县| 桐乡市| 且末县| 漠河县| 晋江市| 澎湖县| 忻州市| 九龙坡区| 合水县| 原平市| 本溪市| 西平县| 岗巴县| 克什克腾旗| 陵水| 临朐县| 崇仁县| 灵山县| 赫章县| 弥渡县| 江城|