首页    期刊浏览 2024年12月01日 星期日
登录注册

文章基本信息

  • 标题:Station Location - Complexity and Approximation
  • 作者:Steffen Mecke ; Anita Sch{\"o}bel ; Dorothea Wagner
  • 期刊名称:OASIcs : OpenAccess Series in Informatics
  • 电子版ISSN:2190-6807
  • 出版年度:2006
  • 卷号:2
  • DOI:10.4230/OASIcs.ATMOS.2005.661
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We consider a geometric set covering problem. In its original form it consists of adding stations to an existing geometric transportation network so that each of a given set of settlements is not too far from a station. The problem is known to be NP-hard in general. However, special cases with certain properties have been shown to be efficiently solvable in theory and in practice, especially if the covering matrix has (almost) consecutive ones property. In this paper we are narrowing the gap between intractable and efficiently solvable cases of the problem. We also present an approximation algorithm for cases with almost consecutive ones property.
  • 关键词:Station Location; facility location; complexity; approximation
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有