咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是3001-3010 订阅
排序:
Approximating the single source unsplittable min-cost flow problem
收藏 引用
MATHEMATICAL PROGRAMMING 2002年 第3期91卷 493-514页
作者: Skutella, M Tech Univ Berlin Fak Math & Nat Wissensch 2 D-10623 Berlin Germany
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs;the demand... 详细信息
来源: 评论
On approximating the maximum diameter ratio of graphs
收藏 引用
DISCRETE MATHEMATICS 2002年 第1-3期244卷 323-330页
作者: Marincek, J Mohar, B Univ Ljubljana Dept Math Ljubljana 1111 Slovenia
It is proved that computing the maximum diameter ratio (also known as the local density) of a graph is APX-complete. The related problem of finding a maximum subgraph of a fixed diameter d greater than or equal to 1 i... 详细信息
来源: 评论
Partitioning problems in dense hypergraphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第3期116卷 179-191页
作者: Czygrinow, A Arizona State Univ Dept Math Tempe AZ 85287 USA
We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma (Szemeredi, Problemes Combinatories et Theorie des Graphes (1978), pp. 399-402) and its algorithmi... 详细信息
来源: 评论
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2002年 第2期140卷 291-321页
作者: Hochbaum, DS Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Univ Calif Berkeley Walter A Haas Sch Business Berkeley CA 94720 USA
We define a class of monotone integer programs with constraints that involve up to three variables each. A generic constraint in such integer program is of the form ax-by≤z+c, where a and b are nonnegative and the va... 详细信息
来源: 评论
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
Solving integer programs over monotone inequalities in three...
收藏 引用
EURO 2000 Conference
作者: Hochbaum, DS Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Univ Calif Berkeley Walter A Haas Sch Business Berkeley CA 94720 USA
We define a class of monotone integer programs with constraints that involve up to three variables each. A generic constraint in such integer program is of the form ax - by≤z + c, where a and b are nonnegative and th... 详细信息
来源: 评论
An efficient distributed algorithm for constructing small dominating sets
An efficient distributed algorithm for constructing small do...
收藏 引用
20th Symposium on Principles of Distributed Computing (PODC 01)
作者: Jia, LJ Rajaraman, R Suel, T Northeastern Univ Coll Comp Sci Boston MA 02115 USA Polytech Univ Dept Comp & Informat Sci Brooklyn NY 11201 USA
The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a node in D. This problem arises in a number of distributed network applications, where it is... 详细信息
来源: 评论
On approximating the maximum diameter ratio of graphs
On approximating the maximum diameter ratio of graphs
收藏 引用
4th Slovenian Graph Theory Conference
作者: Marincek, J Mohar, B Univ Ljubljana Dept Math Ljubljana 1111 Slovenia
It is proved that computing the maximum diameter ratio (also known as the local density) of a graph is APX-complete. The related problem of finding a maximum subgraph of a fixed diameter d greater than or equal to 1 i... 详细信息
来源: 评论
approximation algorithms for independent sets in map graphs
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2001年 第1期41卷 20-40页
作者: Chen, ZZ Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 3500394 Japan
This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, th... 详细信息
来源: 评论
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... 详细信息
来源: 评论