咨询与建议

限定检索结果

文献类型

  • 22,811 篇 会议
  • 9,086 篇 期刊文献
  • 64 篇 学位论文
  • 1 册 图书

馆藏范围

  • 31,962 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 15,965 篇 工学
    • 10,069 篇 计算机科学与技术...
    • 4,864 篇 电气工程
    • 3,097 篇 软件工程
    • 2,689 篇 信息与通信工程
    • 1,952 篇 控制科学与工程
    • 737 篇 机械工程
    • 681 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 232 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 147 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 133 篇 土木工程
  • 10,418 篇 理学
    • 9,357 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 742 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
  • 2,485 篇 管理学
    • 1,929 篇 管理科学与工程(可...
    • 672 篇 工商管理
    • 554 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 207 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,962 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,333 篇 optimization
  • 2,306 篇 approximation me...
  • 2,156 篇 heuristic algori...
  • 1,421 篇 linear programmi...
  • 1,403 篇 convergence
  • 1,272 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,137 篇 signal processin...
  • 955 篇 computer science
  • 910 篇 polynomials
  • 906 篇 clustering algor...
  • 905 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 741 篇 vectors
  • 712 篇 programming
  • 647 篇 estimation
  • 614 篇 transportation
  • 608 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 43 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 carnegie mellon ...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 31 篇 school of comput...
  • 31 篇 nanjing univ sta...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 epfl
  • 28 篇 tel aviv univers...
  • 28 篇 max planck inst ...

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 52 篇 kortsarz guy
  • 45 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 40 篇 kumar amit
  • 37 篇 chen zhi-zhong
  • 36 篇 friggstad zachar...
  • 33 篇 kawarabayashi ke...
  • 32 篇 manurangsi pasin
  • 32 篇 chalermsook pari...
  • 31 篇 wang lusheng
  • 30 篇 gudmundsson joac...
  • 29 篇 thai my t.
  • 29 篇 williamson david...
  • 29 篇 carmi paz
  • 29 篇 zenklusen rico
  • 28 篇 saha barna
  • 27 篇 dinitz michael

语言

  • 31,238 篇 英文
  • 576 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31962 条 记 录,以下是611-620 订阅
排序:
Improved approximation algorithms for the Average-Case Tree Searching Problem
收藏 引用
ALGORITHMICA 2014年 第4期68卷 1045-1074页
作者: Cicalese, Ferdinando Jacobs, Tobias Laber, Eduardo Molinaro, Marco Univ Salerno Dept Comp Sci Fisciano Italy Natl Inst Informat Tokyo Japan Pontificia Univ Catolica Rio de Janeiro Dept Informat Rio de Janeiro Brazil Carnegie Mellon Pittsburgh PA USA
We study the following tree search problem: in a given tree T=(V,E) a vertex has been marked and we want to identify it. In order to locate the marked vertex, we can use edge queries. An edge query e asks in which of ... 详细信息
来源: 评论
A Plant Location Guide for the Unsure: approximation algorithms for Min-Max Location Problems
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2010年 第1期35卷 79-101页
作者: Anthony, Barbara Goyal, Vineet Gupta, Anupam Nagarajan, Viswanath Southwestern Univ Dept Math & Comp Sci Georgetown TX 78626 USA MIT Ctr Operat Res Cambridge MA 02139 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA
This paper studies an extension of the k-median problem under uncertain demand. We are given an n-vertex metric space (V, d) and m client sets {S-i subset of V}(i=1)(m). The goal is to open a set of k facilities F suc... 详细信息
来源: 评论
Outer approximation algorithms for convex vector optimization problems
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2023年 第4期38卷 723-755页
作者: Keskin, Irem Nur Ulus, Firdevs Duke Univ Fuqua Sch Business Durham NC USA Bilkent Univ Dept Ind Engn Ankara Turkiye Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkiye Bilkent Univ Dept Ind Engn Ankara Turkiye
In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is solved iteratively. This scalarizati... 详细信息
来源: 评论
Performance analysis of quantization-based approximation algorithms for precomputing the supported QoS
收藏 引用
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2014年 第1期40卷 244-254页
作者: Hou, Ronghui Lui, King-Shan Leung, Ka-Cheong Baker, Fred Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China Cisco Res Ctr San Jose CA 95134 USA
Precomputation of the supported QoS is very important for internet routing. By constructing routing tables before a request arrives, a packet can be forwarded with a simple table lookup. When the QoS information is pr... 详细信息
来源: 评论
Improved approximation algorithms for two variants of the stable marriage problem with ties
收藏 引用
MATHEMATICAL PROGRAMMING 2015年 第1-2期154卷 353-380页
作者: Huang, Chien-Chung Kavitha, Telikepalli Chalmers Univ Technol S-41296 Gothenburg Sweden Tata Inst Fundamental Res Bombay 400005 Maharashtra India
We consider the problem of computing a large stable matching in a bipartite graph where each vertex ranks its neighbors in an order of preference, perhaps involving ties. Let the matched partner of u in a matching M b... 详细信息
来源: 评论
Dual-Based approximation algorithms for Cut-Based Network Connectivity Problems
收藏 引用
ALGORITHMICA 2018年 第10期80卷 2849-2873页
作者: Grimmer, Benjamin Cornell Univ Ithaca NY 14850 USA
We consider a variety of NP-Complete network connectivity problems. We introduce a novel dual-based approach to approximating network design problems with cut-based linear programming relaxations. This approach gives ... 详细信息
来源: 评论
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
收藏 引用
OPERATIONS RESEARCH LETTERS 1998年 第4-5期22卷 111-118页
作者: Chudak, FA Goemans, MX Hochbaum, DS Williamson, DP IBM Corp Thomas J Watson Res Ctr Yorktown Heights NY 10598 USA Cornell Univ Sch Operat Res & Ind Engn Ithaca NY 14853 USA CORE B-1348 Louvain Belgium Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can be explained in terms of the primal-d... 详细信息
来源: 评论
approximation algorithms for multi commodity flow and normalized cut problems: Implementations and experimental study
Approximation algorithms for multi commodity flow and normal...
收藏 引用
10th Annual International Conference on Computing and Combinatorics, COCOON 2004
作者: Du, Ying Chen, Danny Z. Wu, Xiaodong Department of Computer Science and Engineering University of Notre Dame Notre Dame IN46556 United States Department of Computer Science University of Texas – Pan American EdinburgTX78539 United States
In this paper, we present (1) our implementation of a fast approximation multicommodity flow algorithm, and (2) our implementation of the first provably good approximation algorithm for the minimum normalized cut prob... 详细信息
来源: 评论
EXACT AND approximation algorithms FOR SORTING BY REVERSALS, WITH APPLICATION TO GENOME REARRANGEMENT
收藏 引用
ALGORITHMICA 1995年 第1-2期13卷 180-210页
作者: KECECIOGLU, J SANKOFF, D UNIV MONTREAL CTR RECH MATHMONTREAL H3C 3J7PQCANADA
Motivated by the problem in computational biology of reconstructing the series of chromosome inversions by which one organism evolved from another, we consider the problem of computing the shortest series of reversals... 详细信息
来源: 评论
Models and approximation algorithms for channel assignment in radio networks
收藏 引用
WIRELESS NETWORKS 2001年 第6期7卷 575-584页
作者: Krumke, SO Marathe, MV Ravi, SS Konrad Zuse Zentrum Informat Tech Berlin D-14195 Berlin Germany Los Alamos Natl Lab Los Alamos NM 87545 USA SUNY Albany Dept Comp Sci Albany NY 12222 USA
We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can ... 详细信息
来源: 评论