咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

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

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 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...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

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

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation Algorithm"
3229 条 记 录,以下是3171-3180 订阅
排序:
LINEAR-approximation OF SHORTEST SUPERSTRINGS
收藏 引用
JOURNAL OF THE ACM 1994年 第4期41卷 630-647页
作者: BLUM, A JIANG, T LI, M TROMP, J YANNAKAKIS, M UNIV WATERLOO DEPT COMP SCIWATERLOO N3L 3G1ONCANADA CWI 1009 AB AMSTERDAMNETHERLANDS AT&T BELL LABS MURRAY HILLNJ 07974 MCMASTER UNIV DEPT COMP SCIHAMILTON L8S 4K1ONTARIOCANADA MIT CAMBRIDGEMA 02139
We consider the following problem: given a collection of strings s1,...,s(m), find the shortest string s such that each s(i) appears as a substring (a consecutive block) of s. Although this problem is known to be NP-h... 详细信息
来源: 评论
A WELL-CHARACTERIZED approximation PROBLEM
收藏 引用
INFORMATION PROCESSING LETTERS 1993年 第6期47卷 301-305页
作者: HASTAD, J PHILLIPS, S SAFRA, S STANFORD UNIV DEPT COMP SCISTANFORDCA 94305 IBM CORP ALMADEN RES CTRSAN JOSECA 95120
We consider the following NP optimization problem: Given a set of polynomials P-i(x), i = 1,...,s, of degree at most 2 over GF[p] in n variables, find a root common to as many as possible of the polynomials P-i(x). We... 详细信息
来源: 评论
TIGHT WORST-CASE PERFORMANCE BOUNDS FOR NEXT-K-FIT BIN PACKING
收藏 引用
SIAM JOURNAL ON COMPUTING 1993年 第1期22卷 46-56页
作者: MAO, WZ Coll of William and Mary Williamsburg VA USA
The bin packing problem is to pack a list of reals in (0, 1] into unit-capacity bins using the minimum number of bins. Let R[A] be the limiting worst value for the ratio A(L)/L* as L* goes to infinity, where A(L) deno... 详细信息
来源: 评论
ON THE COMPLEXITY OF 2 CIRCLE CONNECTING PROBLEMS
收藏 引用
DISCRETE APPLIED MATHEMATICS 1993年 第1期47卷 17-32页
作者: HUANG, NF Department of Computer Science National Tsing Hua University Hsinchu Taiwan 300 China
Given n demand points in the plane, the circle connecting problem (CCP) is to locate n circles in the plane, each with its center in a demand point, and determine the radius of each circle such that the corresponding ... 详细信息
来源: 评论
TANDEM BEHAVIOR OF A TELECOMMUNICATION SYSTEM WITH REPEATED CALLS .2. A GENERAL-CASE WITHOUT BUFFERS
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1993年 第2期65卷 247-258页
作者: POURBABAI, B UNIV MARYLAND DEPT MECH ENGNCOLL PKMD 20742 USA
The performance of a telecommunication system consisting of a set of transmitters without local buffers is modelled by a queueing network, and its tandem behavior is approximated in steady state. In this system, a fra... 详细信息
来源: 评论
BOUNDS ON THE PERFORMANCE OF MESSAGE ROUTING HEURISTICS
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1993年 第10期42卷 1253-1256页
作者: BERNHARD, PJ CLEMSON UNIV DEPT COMP SCICLEMSONSC 29631
Let S be a set of messages to be routed on an N x N omega network. In addition, suppose that S contains communication conflicts. One strategy to deal with such conflicts is to partition S into some number of subsets, ... 详细信息
来源: 评论
A NOTE ON A FASTER approximation algorithm FOR THE STEINER PROBLEM IN GRAPHS
收藏 引用
INFORMATION PROCESSING LETTERS 1991年 第4期38卷 177-178页
作者: FLOREN, R Lehrstuhl Inf. XII Univ. Dortmund W-4600 Dortmund 50 FRG
Mehlhorn (1988) has presented an improved implementation of the Kou, Markowsky and Berman Steiner tree approximation algorithm (1981). By replacing one step of the original algorithm the complexity reduces from O(\S\.... 详细信息
来源: 评论
A BOUNDED approximation FOR THE MINIMUM COST 2-SAT PROBLEM
收藏 引用
algorithmICA 1992年 第2期8卷 103-117页
作者: GUSFIELD, D PITT, L UNIV ILLINOIS DEPT COMP SCI URBANA IL 61801 USA
Given a satisfiable Boolean formula in 2-CNF, it is NP-hard to find a satisfying assignment that contains a minimum number of true variables. A polynomial-time approximation algorithm is given that finds an assignment... 详细信息
来源: 评论
EFFECTIVE USE OF MEMORY IN ITERATIVE DEEPENING SEARCH
收藏 引用
INFORMATION PROCESSING LETTERS 1992年 第1期42卷 47-52页
作者: SARKAR, UK CHAKRABARTI, PP GHOSE, S DESARKAR, SC INDIAN INST TECHNOL DEPT COMP SCI & ENGNKHARAGPUR 721302W BENGALINDIA
The Iterative Deepening A* (IDA*) (R.E. Korf, Artificial Intelligence 27 (1985)) algorithm often reexpands too many nodes while solving certain combinatorial problems. algorithm IDA*-CR (U.K. Sarkar et al., Artificial... 详细信息
来源: 评论
COVERING GRID POINTS IN A CONVEX POLYGON WITH STRAIGHT-LINES
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1992年 第3-4期42卷 137-156页
作者: LEE, HS CHANG, RC NATL CHIAO TUNG UNIV INST COMP & INFORMAT SCIHSINCHU 30050TAIWAN NATL CHIAO TUNG UNIV INST COMP SCI & INFORMAT ENGNHSINCHU 30050TAIWAN
We consider the following problem: Find a set of parallel straight lines with equal spacing to hit all m grid points in a closed region bounded by a convex polygon P with n vertices such that size of this set is minim... 详细信息
来源: 评论