咨询与建议

限定检索结果

文献类型

  • 2,443 篇 期刊文献
  • 773 篇 会议
  • 15 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,235 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,329 篇 工学
    • 2,017 篇 计算机科学与技术...
    • 476 篇 电气工程
    • 349 篇 信息与通信工程
    • 338 篇 软件工程
    • 76 篇 机械工程
    • 75 篇 控制科学与工程
    • 70 篇 电子科学与技术(可...
    • 28 篇 仪器科学与技术
    • 28 篇 交通运输工程
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
    • 3 篇 网络空间安全
  • 1,661 篇 理学
    • 1,606 篇 数学
    • 28 篇 生物学
    • 26 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 11 篇 系统科学
    • 10 篇 化学
    • 4 篇 地球物理学
  • 905 篇 管理学
    • 898 篇 管理科学与工程(可...
    • 240 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 244 篇 经济学
    • 240 篇 应用经济学
    • 3 篇 理论经济学
  • 8 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 法学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,235 篇 approximation al...
  • 225 篇 scheduling
  • 81 篇 combinatorial op...
  • 72 篇 approximation al...
  • 69 篇 computational co...
  • 68 篇 np-hard
  • 65 篇 np-hardness
  • 62 篇 linear programmi...
  • 61 篇 np-complete
  • 55 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 44 篇 network design
  • 43 篇 computational ge...
  • 42 篇 dynamic programm...

机构

  • 53 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 19 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 53 篇 du donglei
  • 49 篇 wu weili
  • 48 篇 lin guohui
  • 46 篇 zhang zhao
  • 44 篇 wu chenchen
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 yu wei
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 liu zhaohui
  • 26 篇 wang wei
  • 25 篇 dai haipeng
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 2,999 篇 英文
  • 208 篇 其他
  • 14 篇 中文
检索条件"主题词=Approximation algorithm"
3235 条 记 录,以下是3031-3040 订阅
Hardness of approximation of the discrete time-cost tradeoff problem
收藏 引用
OPERATIONS RESEARCH LETTERS 2001年 第5期29卷 207-210页
作者: Deineko, VG Woeginger, GJ Univ Twente Dept Math NL-7500 AE Enschede Netherlands Univ Warwick Warwick Business Sch Coventry CV4 7AL W Midlands England Graz Tech Univ Inst Math A-8010 Graz Austria
We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature, We prove a strong in-approximability result ... 详细信息
来源: 评论
Wire segmenting for buffer insertion based on RSTP-MSP
收藏 引用
THEORETICAL COMPUTER SCIENCE 2001年 第1-2期262卷 257-267页
作者: Lu, B Gu, J Hu, XD Shragowitz, E Univ Minnesota Dept Comp Sci Minneapolis MN 55455 USA Hong Kong Univ Sci & Technol Dept Comp Sci Hong Kong Hong Kong Peoples R China Chinese Acad Sci Inst Appl Math Beijing Peoples R China
This paper presents an approximation algorithm for simultaneously constructing a rectilinear Steiner tree and buffer insertion points into the tree. The objective of the algorithm is to divide each wire into multiple ... 详细信息
来源: 评论
Using homogeneous weights for approximating the partial cover problem
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2001年 第2期39卷 137-144页
作者: Bar-Yehuda, R Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
In this paper we consider the natural generalizations of two fundamental problems, the Set-Cover problem and the Min-Knapsack problem. We are given a hypergraph, each vertex of which has a nonnegative weight, and each... 详细信息
来源: 评论
Upgrading bottleneck constrained forests
收藏 引用
DISCRETE APPLIED MATHEMATICS 2001年 第1-2期108卷 129-142页
作者: Krumke, SO Marathe, MV Noltemeier, H Ravi, SS Wirth, HC Univ Wurzburg Dept Comp Sci D-97074 Wurzburg Germany Konrad Zuse Zentrum Informat Tech Berlin Dept Optimizat D-14195 Berlin Germany Univ Calif Los Alamos Natl Lab Los Alamos NM 87545 USA SUNY Albany Dept Comp Sci Albany NY 12222 USA
We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V,E) where node nu is an element of V can be upgraded at a cost of c(nu). This upgrade reduces the delay of each lin... 详细信息
来源: 评论
Near-optimal bounded-degree spanning trees
收藏 引用
algorithmICA 2001年 第1-2期29卷 148-180页
作者: Hansen, JC Schmutz, E Heriot Watt Univ Dept Actuarial Math & Stat Edinburgh Midlothian Scotland Drexel Univ Dept Math & Comp Sci Philadelphia PA 19104 USA
Random costs C(i, j) are assigned to the area of a complete directed graph on n labeled vertices. Given the cost matrix C-n = (C(i, j)), let T-k* = T-k*(C-n) be the spanning tree that has minimum cost among spanning t... 详细信息
来源: 评论
Efficient algorithms for integer programs with two variables per constraint
收藏 引用
algorithmICA 2001年 第4期29卷 595-609页
作者: Bar-Yehuda, R Rawitz, D Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Given a bounded integer program with n variables and rn constraints, each with two variables, we present an O (mU) time and O (m) space feasibility algorithm, where U is the maximal variable range size. We show that w... 详细信息
来源: 评论
On the computational complexity of upward and rectilinear planarity testing
收藏 引用
SIAM JOURNAL ON COMPUTING 2001年 第2期31卷 601-625页
作者: Garg, A Tamassia, R SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA Brown Univ Dept Comp Sci Ctr Geometr Comp Providence RI 02912 USA
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve n the vertical direction and no two edges cross. An undirected graph is rectilinear planar if ... 详细信息
来源: 评论
Approximating the minimum k-way cut in a graph via minimum 3-way cuts
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2001年 第4期5卷 397-410页
作者: Zhao, L Nagamochi, H Ibaraki, T Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
For an edge weighted undirected graph G and an integer k > 2, a k-way cut is a set of edges whose removal leaves G with at least k components. We propose a simple approximation algorithm to the minimum k-way cut pr... 详细信息
来源: 评论
Tighter bounds on preemptive job shop scheduling with two machines
收藏 引用
COMPUTING 2001年 第1期67卷 83-90页
作者: Anderson, EJ Jayram, TS Kimbrel, T Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA
We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most P-max/12 greater than the optimal ... 详细信息
来源: 评论
Two-stage open shop scheduling with a bottleneck machine
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2001年 第1期128卷 159-174页
作者: Drobouchevitch, IG Strusevich, VA Univ Greenwich Sch Comp & Math Sci London SE10 9LS England
It is known that for the open shop scheduling problem to minimize the makespan there exists no polynomial-time heuristic algorithm that guarantees a worst-case performance ratio better than 5/4, unless P not equal NP.... 详细信息
来源: 评论