咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 32,005 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 16,009 篇 工学
    • 10,099 篇 计算机科学与技术...
    • 4,880 篇 电气工程
    • 3,123 篇 软件工程
    • 2,683 篇 信息与通信工程
    • 1,951 篇 控制科学与工程
    • 738 篇 机械工程
    • 680 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 229 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 153 篇 测绘科学与技术
    • 135 篇 土木工程
    • 134 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,438 篇 理学
    • 9,373 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 738 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
    • 126 篇 地球物理学
  • 2,489 篇 管理学
    • 1,926 篇 管理科学与工程(可...
    • 673 篇 工商管理
    • 557 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 180 篇 法学
    • 167 篇 社会学
  • 128 篇 文学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,005 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,342 篇 optimization
  • 2,306 篇 approximation me...
  • 2,165 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,409 篇 convergence
  • 1,277 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,140 篇 signal processin...
  • 957 篇 computer science
  • 914 篇 polynomials
  • 908 篇 clustering algor...
  • 906 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 745 篇 vectors
  • 712 篇 programming
  • 648 篇 estimation
  • 614 篇 transportation
  • 612 篇 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 篇 hong kong polyte...
  • 28 篇 tel aviv univers...

作者

  • 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,281 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32005 条 记 录,以下是521-530 订阅
排序:
Spectral Properties of Hypergraph Laplacian and approximation algorithms
收藏 引用
JOURNAL OF THE ACM 2018年 第3期65卷 15-15页
作者: Chan, T. -H. Hubert Louis, Anand Tang, Zhihao Gavin Zhang, Chenzi Univ Hong Kong Comp Sci Dept Pokfulam Rd Hong Kong Hong Kong Peoples R China Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India
The celebrated Cheeger's Inequality (Alon and Milman 1985;Alon 1986) establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on ... 详细信息
来源: 评论
Improved approximation algorithms for Box Contact Representations
收藏 引用
ALGORITHMICA 2017年 第3期77卷 902-920页
作者: Bekos, Michael A. van Dijk, Thomas C. Fink, Martin Kindermann, Philipp Kobourov, Stephen Pupyrev, Sergey Spoerhase, Joachim Wolff, Alexander Univ Tubingen Wilhelm Schickard Inst Informat Tubingen Germany Univ Wurzburg Lehrstuhl Informat 1 Wurzburg Germany Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA Univ Arizona Dept Comp Sci Tucson AZ 85721 USA Ural Fed Univ Inst Math & Comp Sci Ekaterinburg Russia
We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without overlaps in the plane such that two rec... 详细信息
来源: 评论
Fast approximation algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2017年 第3期42卷 854-875页
作者: Gayon, Jean-Philippe Massonnet, Guillaume Rapine, Christophe Stauffer, Gautier Univ Grenoble Alpes CNRS G SCOP F-38000 Grenoble France IMT Atlantique Lab LS2N F-44300 Nantes France Univ Lorraine Lab LGIPM F-57045 Metz 01 France
We consider a well-studied multi-echelon (deterministic) inventory control problem, known in the literature as the one-warehouse multi-retailer (OWMR) problem. We propose a simple and fast 2-approximation algorithm fo... 详细信息
来源: 评论
Improved approximation algorithms for Projection Games
收藏 引用
ALGORITHMICA 2017年 第2期77卷 555-594页
作者: Manurangsi, Pasin Moshkovitz, Dana Univ Calif Berkeley Berkeley CA 94720 USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA
The projection games (aka Label Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label Cover. In ... 详细信息
来源: 评论
Reference points and approximation algorithms in multicriteria discrete optimization
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第3期260卷 829-840页
作者: Buesing, Christina Goetzmann, Kai-Simon Matuschke, Jannik Stiller, Sebastian Rhein Westfal TH Aachen Lehrstuhl Math 2 Pontdriesch 10-12 D-52062 Aachen Germany TU Berlin Inst Math Str 17 Juni 136 D-10623 Berlin Germany Tech Univ Munich TUM Sch Management Arcisstr 21 D-80333 Munich Germany
Mathematical research on multicriteria optimization problems predominantly revolves around the set of Pareto optimal solutions. In practice, on the other hand, methods that output a single solution are more widespread... 详细信息
来源: 评论
Parameterized and approximation algorithms for the Load Coloring Problem
收藏 引用
ALGORITHMICA 2017年 第1期79卷 211-229页
作者: Barbero, F. Gutin, G. Jones, M. Sheng, B. Royal Holloway Univ London Egham TW20 0EX Surrey England
Let c, k be two positive integers. Given a graph , the c-Load Coloring problem asks whether there is a c-coloring such that for every , there are at least k edges with both endvertices colored i. Gutin and Jones (Inf ... 详细信息
来源: 评论
DETERMINISTIC POLYNOMIAL-TIME approximation algorithms FOR PARTITION FUNCTIONS AND GRAPH POLYNOMIALS
收藏 引用
SIAM JOURNAL ON COMPUTING 2017年 第6期46卷 1893-1919页
作者: Patel, Viresh Regts, Guus Univ Amsterdam Korteweg de Vries Inst Mat NL-1098 XH Amsterdam Netherlands
In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In partic... 详细信息
来源: 评论
A note on approximation algorithms of the clustered traveling salesman problem
收藏 引用
INFORMATION PROCESSING LETTERS 2017年 127卷 54-57页
作者: Bao, Xiaoguang Liu, Zhaohui Yu, Wei Li, Ganggang Shanghai Ocean Univ Coll Informat Technol Shanghai 201306 Peoples R China East China Univ Sci & Technol Dept Math Shanghai 200237 Peoples R China Jiangxi Univ Finance & Econ Sch Informat Technol Nanchang 330013 Jiangxi Peoples R China
In an earlier paper (Bao and Liu [1]), we considered a version of the clustered traveling salesman problem (CTSP), in which both the starting and ending vertex of each cluster are free to be selected, and proposed a 2... 详细信息
来源: 评论
The Computational Complexity of and approximation algorithms for Variants of the Component Selection Problem
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2018年 第7期29卷 1231-1245页
作者: Nouri-Baygi, Mostafa Ferdowsi Univ Mashhad Dept Comp Engn Mashhad Iran
In the past decades, there has been a burst of activity to simplify implementation of complex software systems. The solution framework in software engineering community for this problem is called component-based softw... 详细信息
来源: 评论
An experimental evaluation of fast approximation algorithms for the maximum satisfiability problem
收藏 引用
ACM Journal of Experimental Algorithmics 2017年 第PP1–18期22卷 1–18页
作者: Poloczek, Matthias Williamson, David P. Department of Systems and Industrial Engineering University of Arizona 1127 E. James E. Rogers Way TucsonAZ85721 United States School of Operations Research and Information Engineering Cornell University 236 Rhodes Hall IthacaNY14853 United States
We evaluate the performance of fast approximation algorithms for MAX SAT on the comprehensive benchmark sets from the SAT and MAX SAT contests. Our examination of a broad range of algorithmic techniques reveals that g... 详细信息
来源: 评论