咨询与建议

限定检索结果

文献类型

  • 5 篇 会议
  • 1 篇 期刊文献

馆藏范围

  • 6 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 5 篇 计算机科学与技术...
    • 3 篇 电气工程
    • 1 篇 信息与通信工程

主题

  • 6 篇 distributed netw...
  • 5 篇 approximation al...
  • 2 篇 k-edge-connectiv...
  • 2 篇 distributed grap...
  • 2 篇 connectivity aug...
  • 1 篇 game-theoretic m...
  • 1 篇 hardness of appr...
  • 1 篇 pairwise stabili...
  • 1 篇 price of anarchy
  • 1 篇 spanners
  • 1 篇 nash equilibrium

机构

  • 4 篇 technion dept co...
  • 1 篇 technion haifa
  • 1 篇 harvard universi...
  • 1 篇 swiss fed inst t...

作者

  • 5 篇 dory michal
  • 3 篇 censor-hillel ke...
  • 1 篇 ghaffari mohsen
  • 1 篇 jacomo corbo
  • 1 篇 david parkes

语言

  • 6 篇 英文
检索条件"主题词=distributed network design"
6 条 记 录,以下是1-10 订阅
排序:
Fast distributed approximation for TAP and 2-edge-connectivity
收藏 引用
distributed COMPUTING 2020年 第2期33卷 145-168页
作者: Censor-Hillel, Keren Dory, Michal Technion Dept Comp Sci Haifa Israel
The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to augment T with a minimum set of edges Aug from G, such that... 详细信息
来源: 评论
distributed Spanner Approximation  18
Distributed Spanner Approximation
收藏 引用
37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)
作者: Censor-Hillel, Keren Dory, Michal Technion Dept Comp Sci Haifa Israel
We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness res... 详细信息
来源: 评论
Improved distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph  19
Improved Distributed Approximations for Minimum-Weight Two-E...
收藏 引用
38th ACM Symposium on Principles of distributed Computing (PODC)
作者: Dory, Michal Ghaffari, Mohsen Technion Haifa Israel Swiss Fed Inst Technol Zurich Switzerland
The minimum-weight 2-edge-connected spanning subgraph (2-ECSS) problem is a natural generalization of thewell-studied minimumweight spanning tree (MST) problem, and it has received considerable attention in the area o... 详细信息
来源: 评论
Brief Announcement: distributed Approximation for Tree Augmentation  17
Brief Announcement: Distributed Approximation for Tree Augme...
收藏 引用
36th ACM Symposium on Principles of distributed Computing (PODC)
作者: Censor-Hillel, Keren Dory, Michal Technion Dept Comp Sci Haifa Israel
A minimum spanning tree (MST) is an essential structure for distributed algorithms, since it is a low-cost connected subgraph which provides an efficient way to communicate in a network. However, trees cannot survive ... 详细信息
来源: 评论
distributed Approximation of Minimum k-edge-connected Spanning Subgraphs  18
Distributed Approximation of Minimum <i>k</i>-edge-connected...
收藏 引用
37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)
作者: Dory, Michal Technion Dept Comp Sci Haifa Israel
In the minimum k-edge-connected spanning subgraph (k-ECSS) problem the goal is to find the minimum weight subgraph resistant to up to k - 1 edge failures. This is a central problem in network design, and a natural gen... 详细信息
来源: 评论
The price of selfish behavior in bilateral network formation  05
The price of selfish behavior in bilateral network formation
收藏 引用
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
作者: Jacomo Corbo David Parkes Harvard University
Given a collection of selfish agents who wish to establish links to route traffic among themselves, the set of equilibrium network topologies may appear quite different from the centrally enforced optimum. We study th... 详细信息
来源: 评论