首页> 外文会议>International Workshop on Approximation and Online Algorithms >An FPTAS for Flows over Time with Aggregate Arc Capacities
【24h】

An FPTAS for Flows over Time with Aggregate Arc Capacities

机译:随着时间的推移而流动的FPTA

获取原文

摘要

We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dependent flow rate that must always be bounded by the arc's capacity. Only recently, Melkonian introduced an alternative model where so-called bridge capacities bound the total amount of flow traveling along an arc, at any point of time. The contribution of this paper is twofold. Firstly, we introduce a common generalization of both the classical flow over time model and Melko-nian's model. Secondly, we present a non-trivial extension of an FPTAS by Fleischer and Skutella to our new flow model. Prior to this, no approximation algorithm was known for Melkonian's model.
机译:我们研究随着弧线上运输时间的网络流动。运输时间描述遍历弧形需要多长时间。随着时间的流程,每个电弧指定一个必须始终受电弧容量界限的时间相关的流量。据近来,梅尔克尼亚人介绍了一种替代模型,其中所谓的桥接能力在任何时间点绑定沿弧线行驶的总流量。本文的贡献是双重的。首先,我们介绍了古典流量随时间模型和Melko-Nian模型的共同概括。其次,我们通过Fleischer和Skutella向我们的新流程模型提出了FPTA的非琐碎延伸。在此之前,Melkonian模型中不知道近似算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号