咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 3,231 篇 电子文献
  • 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 篇 地球物理学
  • 899 篇 管理学
    • 892 篇 管理科学与工程(可...
    • 237 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 244 篇 经济学
    • 237 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,231 篇 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,003 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=approximation algorithm"
3231 条 记 录,以下是3011-3020 订阅
排序:
approximation algorithms for maximum two-dimensional pattern matching
收藏 引用
THEORETICAL COMPUTER SCIENCE 2001年 第1-2期255卷 51-62页
作者: Arikati, SR Dessmark, A Lingas, A Marathe, MV Lund Univ Dept Comp Sci S-22100 Lund Sweden Univ Memphis Dept Math Sci Memphis TN 38152 USA Los Alamos Natl Lab Los Alamos NM 87545 USA Max Planck Inst Informat Saarbrucken Germany
We introduce the following optimization version of the classical pattern matching problem (referred to as the maximum pattern matching problem). Given a two-dimensional rectangular text and a two-dimensional rectangul... 详细信息
来源: 评论
Approximating bandwidth by mixing layouts of interval graphs
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第4期15卷 435-449页
作者: Kratsch, D Stewart, L Univ Jena Fak Math & Informat D-07740 Jena Germany Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
We examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). We show that all of these graph classes admit efficient appro... 详细信息
来源: 评论
A note on approximating the survivable network design problem in hypergraphs
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2002年 第2期E85D卷 322-326页
作者: Zhao, L Nagamochi, H Ibaraki, T Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan Toyohashi Univ Technol Dept Informat & Comp Sci Toyohashi Aichi 4418580 Japan
We consider to design approximation algorithms for the survivable network design problem in hypergraphs (SNDPHG) based on algorithms developed for the survivable network design problem in graphs (SNDP) or the element ... 详细信息
来源: 评论
Scheduling unrelated machines by randomized rounding
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第4期15卷 450-469页
作者: Schulz, AS Skutella, M MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA Tech Univ Berlin Fak 2 Inst Math D-10623 Berlin Germany
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea is to assign jobs randomly to machines... 详细信息
来源: 评论
SEMI-DEFINITE RELAXATION algorithm OF MULTIPLE KNAPSACK PROBLEM
收藏 引用
Applied Mathematics(A Journal of Chinese Universities) 2002年 第2期17卷 241-250页
作者: Chen Feng Yao EnyuDept.ofMath.,ZhejiangUniv.,Hangzhou310027,China Dept. of Math. Zhejiang Univ. Hangzhou China
The multiple knapsack problem denoted by MKP (B,S,m,n) can be defined as fol- lows.A set B of n items and a set Sof m knapsacks are given such thateach item j has a profit pjand weightwj,and each knapsack i has a ca... 详细信息
来源: 评论
STATION LAYOUTS IN THE PRESENCE OF LOCATION CONSTRAINTS
收藏 引用
Journal of Interconnection Networks 2002年 第1N02期3卷 1-17页
作者: PROSENJIT BOSE EVANGELOS KRANAKIS CHRISTOS KAKLAMANIS LEFTERIS M. KIROUSIS DANNY KRIZANC DAVID PELEG Carleton University School of Computer Science Ottawa Ontario K1S 5B6 Canada University of Patras Department of Computer Engineering and Informatics GR-26504 Patras Greece Wesleyan University Department of Mathematics Middletown CT 06459 USA Weizmann Institute of Science Department of Computer Science and Applied Mathematics Rehovot 76100 Israel
In wireless communication, the signal of a typical broadcast station is transmitted from a broadcast center p and reaches objects at a distance, say, r from it. In addition there is a radius r 0 , r 0 < r, such tha... 详细信息
来源: 评论
A PTAS for single machine scheduling with controllable processing times
收藏 引用
Acta Cybernetica 2002年 第3期15卷 369-378页
作者: Schuurman, Petra Woeginger, Gerhard J. Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven Netherlands Institut für Mathematik B TU Graz Steyrergasse 30 A-8010 Graz Austria Department of Mathematics University of Twente 7500 AE Enschede Netherlands
We deal with a single machine scheduling problem in which each job has a release date, a delivery time and a controllable processing time. The fact that the jobs have a controllable processing time means that it is al... 详细信息
来源: 评论
approximation algorithms for budget-constrained auctions  4
收藏 引用
4th International Workshop on approximation algorithms for Combinatorial Optimization Problems/5th Int Workshop on Randomization and approximation Techniques in Comp Sci
作者: Garg, R Kumar, V Pandit, V Indian Inst Technol IBM India Res Lab New Delhi 110016 India
Recently there has been a surge of interest in auctions research triggered on the one hand by auctions of bandwidth and other public assets and on the other by the popularity of Internet auctions and the possibility o... 详细信息
来源: 评论
An 0.828-approximation algorithm for the uncapacitated facility location problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 1999年 第2-3期93卷 149-156页
作者: Ageev, AA Sviridenko, MI Sobolev Inst Math Novosibirsk 630090 Russia
The uncapacitated facility location problem in the following formulation is considered: max(S subset of or equal to I) Z(S) = Sigma(j is an element of J)max(i is an element of S)b(ij) - Sigma(i is an element of S)c(i)... 详细信息
来源: 评论
A 3-approximation algorithm for the k-level uncapacitated facility location problem
收藏 引用
INFORMATION PROCESSING LETTERS 1999年 第5-6期72卷 161-167页
作者: Aardal, K Chudak, FA Shmoys, DB Univ Utrecht Dept Comp Sci NL-3508 TB Utrecht Netherlands IBM Corp Thomas J Watson Res Ctr Yorktown Heights NY 10598 USA Cornell Univ Sch Operat Res & Ind Engn Ithaca NY 14853 USA
In the k-level uncapacitated facility location problem, we have a set of demand points where clients are located. The demand of each client is known. Facilities have to be located at given sites in order to service th... 详细信息
来源: 评论