magnate
发表于 2025-3-30 11:53:07
http://reply.papertrans.cn/103/10201/1020034/1020034_51.png
Precursor
发表于 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.
LUDE
发表于 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.
Ballad
发表于 2025-3-31 04:02:20
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1020034.jpg
hypertension
发表于 2025-3-31 06:29:23
http://reply.papertrans.cn/103/10201/1020034/1020034_56.png
手铐
发表于 2025-3-31 10:24:08
http://reply.papertrans.cn/103/10201/1020034/1020034_57.png
永久
发表于 2025-3-31 16:28:46
http://reply.papertrans.cn/103/10201/1020034/1020034_58.png
军火
发表于 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.
Pelvic-Floor
发表于 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.