咨询与建议

限定检索结果

文献类型

  • 59 篇 期刊文献
  • 17 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 55 篇 工学
    • 53 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 4 篇 信息与通信工程
    • 4 篇 软件工程
    • 1 篇 机械工程
    • 1 篇 交通运输工程
  • 45 篇 理学
    • 45 篇 数学
  • 20 篇 管理学
    • 20 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 9 篇 经济学
    • 9 篇 应用经济学
  • 2 篇 军事学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 76 篇 polynomial time ...
  • 16 篇 scheduling
  • 15 篇 approximation al...
  • 10 篇 approximation al...
  • 5 篇 capacitated vehi...
  • 4 篇 parallel machine...
  • 4 篇 fully polynomial...
  • 4 篇 dynamic programm...
  • 3 篇 np-hard
  • 3 篇 worst-case analy...
  • 3 篇 mobile edge comp...
  • 3 篇 makespan
  • 3 篇 unit disk graph
  • 3 篇 ptas
  • 3 篇 rejection penalt...
  • 2 篇 traveling salesm...
  • 2 篇 energy efficient
  • 2 篇 computation offl...
  • 2 篇 lower bound
  • 2 篇 vehicle scheduli...

机构

  • 5 篇 ural fed univ ek...
  • 5 篇 texas a&m univ d...
  • 5 篇 krasovsky inst m...
  • 4 篇 depaul univ sch ...
  • 4 篇 cent s univ coll...
  • 4 篇 lafayette coll d...
  • 4 篇 omsk state tech ...
  • 4 篇 univ texas dalla...
  • 3 篇 yunnan univ sch ...
  • 3 篇 arkansas state u...
  • 3 篇 hong kong polyte...
  • 2 篇 sun yat sen univ...
  • 2 篇 kunming univ sci...
  • 2 篇 shandong jianzhu...
  • 2 篇 bell labs murray...
  • 2 篇 univ alberta dep...
  • 2 篇 qujing normal un...
  • 2 篇 univ hong kong d...
  • 2 篇 yunnan univ peop...
  • 2 篇 new jersey inst ...

作者

  • 6 篇 li weidong
  • 5 篇 wang wei
  • 5 篇 khachay michael
  • 4 篇 xia ge
  • 4 篇 li jianping
  • 4 篇 kanj iyad a.
  • 4 篇 chen jianer
  • 3 篇 friggstad zachar...
  • 3 篇 liu jun
  • 3 篇 li chung-lun
  • 3 篇 liu xi
  • 3 篇 ogorodnikov yuri
  • 3 篇 li guojun
  • 3 篇 huang xiuzhen
  • 3 篇 jansen klaus
  • 3 篇 salavatipour moh...
  • 3 篇 wu weili
  • 2 篇 zhang xuejie
  • 2 篇 kim donghyun
  • 2 篇 zhang zhao

语言

  • 68 篇 英文
  • 8 篇 其他
检索条件"主题词=Polynomial Time Approximation Scheme"
76 条 记 录,以下是71-80 订阅
排序:
Traveling salesman problem of segments
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2004年 第1-2期14卷 19-40页
作者: Xu, JH Lin, ZY Yang, Y Berezney, R SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA SUNY Buffalo Dept Biol Sci Buffalo NY 14260 USA
In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n epsilon-... 详细信息
来源: 评论
On the k-closest substring and k-consensus pattern problems
On the <i>k</i>-closest substring and <i>k</i>-consensus pat...
收藏 引用
15th Annual Symposium on Combinatorial Pattern Matching
作者: Jiao, YS Xu, JY Li, M Chinese Acad Sci Bioinformat Lab Comp Technol Inst Beijing Peoples R China
Given a set S = {s(1), s(2), ..., s(n)} of strings each of length m, and an integer L, we study the following two problems. k-CLOSEST SUBSTRING problem: find k center strings c(1), c(2), ..., c(k) of length L minimizi... 详细信息
来源: 评论
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期237卷 105-122页
作者: Schuurman, P Woeginger, GJ Graz Univ Technol Inst Math B A-8010 Graz Austria Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands
In this paper we investigate the two-stage multiprocessor flow shop scheduling problem F2(P)\ . \C-max, where the numbers m(1) and m(2) of machines available in the two stages are part of the input. We demonstrate the... 详细信息
来源: 评论
The task allocation problem with constant communication
收藏 引用
DISCRETE APPLIED MATHEMATICS 2003年 第1期131卷 169-177页
作者: de la Vega, WF Lamari, M Univ Paris 11 Rech Informat Lab CNRS Ctr Orsay F-91405 Orsay France
In the module allocation problem we are given n tasks t(1),...,t(n) to be executed by m processors P-1,...,P-m, subject to both execution and communication costs. The cost of any assignment of the tasks to the process... 详细信息
来源: 评论
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
收藏 引用
Journal of Discrete Algorithms 2003年 第1期1卷 67-76页
作者: Duckworth, William Wormald, Nicholas C. Zito, Michele Department of Mathematics and Statistics University of Melbourne Parkville VIC 3052 Australia Department of Computer Science University of Liverpool Liverpool L69 7ZF United Kingdom
A t-spanner of an undirected, unweighted graph G is a spanning subgraph S of G with the added property that for every pair of vertices in G, the distance between them in S is at most t times the distance between them ... 详细信息
来源: 评论
A PTAS for minimizing weighted completion time on uniformly related machines - (Extended abstract)
收藏 引用
28th International Colloquium on Automata, Languages and Programming (ICALP 2001)
作者: Chekuri, C Khanna, S Bell Labs Murray Hill NJ 07974 USA Univ Penn Dept CIS Philadelphia PA 19104 USA
We consider the well known problem of scheduling jobs with release dates to minimize their average weighted completion time. When multiple machines are available, the machine environment may range from identical machi... 详细信息
来源: 评论