188宝金博页面版

  • 图案背景
  • 纯色背景
视图
标记
批注
批注本地保存成功，开通会员云端永久保存 去开通
gaso521467..

上传于：2013-11-02

粉丝量：35

该文档贡献者很忙，什么也没留下。


  • 相关
  • 目录
  • 笔记
  • 书签

188宝金博页面版:更多相关文档

  • 【精品】abstract

    星级： 12 页

  • Abstract - ????????????????????????

    星级： 65 页

  • (Abstract)

    星级： 3 页

  • 【精品】} Abstract}

    星级： 19 页

  • Abstract※

    星级： 2 页

  • 【精品】Abstract Abstract System

    星级： 13 页

  • [精品]Abstract

    星级： 8 页

  • [精品](abstract)

    星级： 6 页

  • abstract here is abstract.

    星级： 2 页

  • abstractsabstracts

    星级： 8 页

暂无目录

点击鼠标右键菜单,创建目录

    暂无笔记

    选择文本，点击鼠标右键菜单，添加笔记

    暂无书签

    在左侧文档中，点击鼠标右键，添加书签

    188宝金博页面版: 【精品】Abstract

    下载积分： 720

    内容提示： Lower-Stretch Spanning TreesMichael Elkin?Department of Computer ScienceBen-Gurion University of the NegevY. EmekWeizmann Institute of Science,Department of Computer Scienceand MathematicsShang-Hua Teng?Department of Computer ScienceBoston University andAkamai Technologies Inc.Daniel A. Spielman?Department of MathematicsMassachusetts Institute of TechnologyFebruary 6, 2005AbstractIn 1991, Alon, Karp, Peleg, and West proved that every weighted connected graph G containsas a subgraph a spanning tree into ...

    文档格式：PDF | 页数：20 | 浏览次数：13 | 上传日期：2013-11-02 11:21:39 | 文档星级：
    Lower-Stretch Spanning TreesMichael Elkin∗Department of Computer ScienceBen-Gurion University of the NegevY. EmekWeizmann Institute of Science,Department of Computer Scienceand MathematicsShang-Hua Teng‡Department of Computer ScienceBoston University andAkamai Technologies Inc.Daniel A. Spielman†Department of MathematicsMassachusetts Institute of TechnologyFebruary 6, 2005AbstractIn 1991, Alon, Karp, Peleg, and West proved that every weighted connected graph G containsas a subgraph a spanning tree into which the edges of G can be embedded with average stretchexpO(√log n loglogn), and that there exists an n-vertex graph G such that all its spanningtrees have average stretch ?(log n).Closing the exponential gap between these upper andlower bounds is listed as one of the long-standing open questions in the area of low-distortionembeddings of metrics (Matousek 2002).We significantly reduce this gap by constructing a spanning tree in G of average stretchO((log n loglogn)2). Moreover, we show that this tree can be constructed in time O(m log2n)in general, and in time O(m log n) if the input graph is unweighted. The main ingredient in ourconstruction is a novel graph decomposition technique.Our new algorithm can be immediately used to improve the running time of the recent solverfor diagonally dominant linear systems of Spielman and Teng fromm2(O(√log n log log n))log(1/)tom logO(1)n log(1/),and to O(n(log n log logn)2log(1/)) when the system is planar. Applying a recent reduction ofBoman, Hendrickson and Vavasis, this provides an O(n(log n log logn)2log(1/)) time algorithmfor solving the linear systems that arise when applying the finite element method to solve two-dimensional elliptic partial differential equations. Our result can also be used to improve severalearlier approximation algorithms that use low-stretch spanning trees.∗Part of this work was done in Yale University, and was was supported by the DoD University Research Initiative(URI) administered by the Office of Naval Research under Grant N00014-01-1-0795. The work was also partiallysupported by the Lynn and William Frankel Center for Computer Sciences.†Partially supported by NSF grant CCR-0324914. Part of this work was done at Yale University.‡Partially supported by NSF grants CCR-0311430 and ITR CCR-0325630.

    阅读了该文档的用户还阅读了这些文档

    188宝金博页面版:关于我们

    188宝金博页面版:帮助中心

    188宝金博页面版:关注我们

    • 新浪微博

    关注188宝金博页面版公众号

    188宝金博页面版
    阅读
    APP
    阅读
    返回
    顶部
    188宝金博页面版官网登录在线平台入口（2026已更新）—江苏协昌电子科技股份有限公司