咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是2971-2980 订阅
排序:
Approximability of the minimum maximal matching problem in planar graphs
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2003年 第12期E86A卷 3251-3258页
作者: Nagamochi, H Nishida, Y Ibaraki, T Toyohashi Univ Technol Dept Informat & Comp Sci Toyohashi Aichi 4418580 Japan Japan Res Inst Ltd Osaka 5500013 Japan Kyoto Univ Fac Informat Dept Appl Math & Phys Kyoto 6068501 Japan
Given an edge-weighted graph G, the minimum maximal matching problem asks to find a minimum weight maximal matching. The problem is known to be NP-hard even if the graph is planar and unweighted. In this paper, we con... 详细信息
来源: 评论
approximation algorithms for local alignment with length constraints
收藏 引用
International Journal of Foundations of Computer Science 2002年 第5期13卷 751-767页
作者: Arslan, Abdullah N. Eǧecioǧlu, Ömer Department of Computer Science University of California Santa Barbara Santa Barbara CA 93106 United States
The local sequence alignment problem is the detection of similar subsequences in two given sequences of lengths n ≥ m. Unfortunately the common notion of local alignment suffers from some well-known anomalies which r... 详细信息
来源: 评论
Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2003年 第1期14卷 268-283页
作者: Tseng, P Univ Washington Dept Math Seattle WA 98195 USA
We study approximation bounds for the semidefinite programming (SDP) relaxation of quadratically constrained quadratic optimization: min f(0)(x) subject to f(k)(x) less than or equal to 0, k = 1,..., m, where f(k)(x) ... 详细信息
来源: 评论
Improved approximation algorithms for multilevel facility location problems
收藏 引用
OPERATIONS RESEARCH LETTERS 2002年 第5期30卷 327-332页
作者: Ageev, AA Sobolev Inst Math Novosibirsk 630090 Russia
We show that the metric multilevel facility location problem is polynomial-time reducible within a factor of 3 to the metric uncapacitated facility location problem. This leads to a combinatorial 4.83-approximation al... 详细信息
来源: 评论
Constructing worst case instances for semidefinite programming based approximation algorithms
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第1期15卷 58-72页
作者: Alon, N Sudakov, B Zwick, U Tel Aviv Univ Raymond & Beverly Sackler Fac Exact Sci Dept Math IL-69978 Tel Aviv Israel Princeton Univ Dept Math Princeton NJ 08540 USA Tel Aviv Univ Raymond & Beverly Sackler Fac Exact Sci Dept Comp Sci IL-69978 Tel Aviv Israel
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio t... 详细信息
来源: 评论
An approximation algorithm for two-dimensional warping
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2000年 第1期E83D卷 109-111页
作者: Uchida, S Sakoe, H Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 8128581 Japan
A new efficient two-dimensional warping algorithm is presented, in which sub-optimal warping is attained by iterating DP-based local optimization of warp on partially overlapping subplane sequence. From an experimenta... 详细信息
来源: 评论
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第1-2期119卷 107-116页
作者: Gutin, G Yeo, A Univ London Royal Holloway & Bedford New Coll Dept Comp Sci Egham TW20 0EX Surrey England
Glover and Punnen (J. Oper. Res. Soc. 48 (1997) 502) asked whether there exists a polynomial time algorithm that always produces a tour which is not worse than at least n!/p(n) tours for some polynomial p(n) for every... 详细信息
来源: 评论
Well-separated pair decomposition for the unit-disk graph metric and its applications  03
Well-separated pair decomposition for the unit-disk graph me...
收藏 引用
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
作者: Jie Gao Li Zhang Stanford University Stanford CA Systems Research Center Hewlett-Packard Labs Palo Alto CA
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk graph metric: the shortest path distance metric induced by the intersection graph of unit disks. We show that for the ... 详细信息
来源: 评论
(1+ε)-approximation of sorting by reversals and transpositions
收藏 引用
THEORETICAL COMPUTER SCIENCE 2002年 第1期289卷 517-529页
作者: Eriksen, N Royal Inst Technol Dept Math S-10044 Stockholm Sweden
Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions needed to sort a permutation. There is evidence that, from the point of view of computational molecular biology, a mor... 详细信息
来源: 评论
An approximation result for the interval coloring problem on claw-free chordal graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第1-3期120卷 73-90页
作者: Confessore, G Dell'Olmo, P Giordani, S Univ Roma Tor Vergata Dipartimento Informat Sistemi & Prod I-00133 Rome Italy CNR Ist Tecnol Ind & Automaz I-20131 Milan Italy Univ Roma La Sapienza Dipartimento Probabil Stat & Stat Applicate I-00185 Rome Italy Univ Roma Tor Vergata Ctr Interdipartimentale Vito Volterra I-00133 Rome Italy
We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution... 详细信息
来源: 评论