首页    期刊浏览 2025年07月08日 星期二
登录注册

文章基本信息

  • 标题:Network Construction with Ordered Constraints
  • 作者:Yi Huang ; Mano Vikash Janardhanan ; Lev Reyzin
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2018
  • 卷号:93
  • 页码:34:34-34:13
  • DOI:10.4230/LIPIcs.FSTTCS.2017.34
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not reflected in previous, more general models. We give hardness of approximation results and nearly-matching upper bounds for the offline problem, and we study the online problem in both general graphs and restricted sub-classes. In the online problem, for general graphs, we give exponentially better upper bounds than exist for algorithms for general connectivity problems. For the restricted classes of stars and paths we are able to find algorithms with optimal competitive ratios, the latter of which involve analysis using a potential function defined over PQ-trees.
  • 关键词:subgraph connectivity; network construction; ordered connectivity constraints; PQ-trees
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有