咨询与建议

限定检索结果

文献类型

  • 22,842 篇 会议
  • 9,117 篇 期刊文献
  • 64 篇 学位论文

馆藏范围

  • 32,023 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 32,023 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,345 篇 optimization
  • 2,306 篇 approximation me...
  • 2,167 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,411 篇 convergence
  • 1,278 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,141 篇 signal processin...
  • 956 篇 computer science
  • 914 篇 polynomials
  • 909 篇 complexity theor...
  • 908 篇 clustering algor...
  • 789 篇 mathematical mod...
  • 752 篇 vectors
  • 712 篇 programming
  • 652 篇 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,298 篇 英文
  • 573 篇 其他
  • 113 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32023 条 记 录,以下是631-640 订阅
排序:
approximation algorithms for sorting by length-weighted prefix and suffix operations
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 593卷 26-41页
作者: Lintzmayer, Carla Negri Fertin, Guillaume Dias, Zanoni Univ Estadual Campinas Inst Comp BR-13083852 Campinas SP Brazil Univ Nantes UMR CNRS 6241 Lab Informat Nantes Atlantique F-44322 Nantes 3 France
The traditional approach for the problems of sorting permutations by rearrangements is to consider that all operations have the same unitary cost. In this case, the goal is to find the minimum number of allowed rearra... 详细信息
来源: 评论
approximation algorithms for digraph width parameters
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第C期562卷 365-376页
作者: Kintali, Shiva Kothari, Nishad Kumar, Akash Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA
Several problems that are NP-hard on general graphs are efficiently solvable on graphs with bounded treewidth. Efforts have been made to generalize treewidth and the related notion of pathwidth to digraphs. Directed t... 详细信息
来源: 评论
approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2015年 第3期30卷 403-412页
作者: Kacem, Imed Kellerer, Hans Lanuel, Yann Univ Lorraine LCOMS EA 7603 F-57000 Metz France Graz Univ ISOR Graz Austria
In this paper we consider the maximization of the weighted number of early jobs on a single machine with non-availability constraints. We deal with the resumable and the non-resumable cases. We show that the resumable... 详细信息
来源: 评论
approximation algorithms for clique transversals on some graph classes
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第9期115卷 667-670页
作者: Lin, Min Chih Vasiliev, Saveliy Univ Buenos Aires CONICET RA-1053 Buenos Aires DF Argentina Univ Buenos Aires FCEyN Inst Calculo RA-1053 Buenos Aires DF Argentina
Given a graph G = (V. E) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a m... 详细信息
来源: 评论
Inequity aversion pricing over social networks: approximation algorithms and hardness results  41
Inequity aversion pricing over social networks: Approximatio...
收藏 引用
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016
作者: Amanatidis, Georgios Markakis, Evangelos Sornat, Krzysztof Athens University of Economics and Business Athens Greece University of Wroclaw Wroclaw Poland
We study a revenue maximization problem in the context of social networks. Namely, we consider a model introduced by Alon, Mansour, and Tennenholtz (EC 2013) that captures inequity aversion, i.e., prices offered to ne... 详细信息
来源: 评论
approximation algorithms for hard capacitated k-facility location problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2015年 第2期242卷 358-368页
作者: Aardal, Karen van den Berg, Pieter L. Gijswijt, Dion Li, Shanfei Delft Univ Technol Delft Inst Appl Math NL-2628 CD Delft Netherlands Ctr Wiskunde Informat NL-1098 XG Amsterdam Netherlands Natl Univ Def Technol Fac Informat Syst & Management Changsha 410073 Hunan Peoples R China
We study the capacitated k-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a positive integer k. It costs f(i) to open facility i, and c(ij) for ... 详细信息
来源: 评论
approximation and parameterized algorithms for geometric independent set with shrinking  42
Approximation and parameterized algorithms for geometric ind...
收藏 引用
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
作者: Pilipczuk, Michal Van Leeuwen, Erik Jan Wiese, Andreas Institute of Informatics University of Warsaw Poland Department of Information and Computing Sciences Utrecht University Netherlands Department of Industrial Engineering and Center for Mathematical Modeling Universidad de Chile Chile
Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriou... 详细信息
来源: 评论
approximation algorithms for the arc orienteering problem
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第2期115卷 313-315页
作者: Gavalas, Damianos Konstantopoulos, Charalampos Mastakas, Konstantinos Pantziou, Grammati Vathis, Nikolaos Univ Aegean Dept Cultural Technol & Commun Mitilini Greece Univ Piraeus Dept Informat Karaoli Greece Natl Tech Univ Athens Sch Appl Math & Phys Sci GR-10682 Athens Greece Technol Educ Inst Athens Dept Informat Athens Greece Natl Tech Univ Athens Sch Elect & Comp Engn GR-10682 Athens Greece Comp Technol Inst & Press Diophantus Patras Greece
In this article we present approximation algorithms for the Arc Orienteering Problem (AOP). We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a (6 + epsilon + ... 详细信息
来源: 评论
Improved approximation algorithms for Matroid and Knapsack Median Problems and Applications
收藏 引用
ACM TRANSACTIONS ON algorithms 2016年 第4期12卷 49-49页
作者: Swamy, Chaitanya Univ Waterloo Dept Combinator & Optimizat 200 Univ Ave West Waterloo ON N2L 3G1 Canada
We consider the matroid median problem [Krishnaswamy et al. 2011], wherein we are given a set of facilities with opening costs and a matroid on the facility-set, and clients with demands and connection costs, and we s... 详细信息
来源: 评论
approximation algorithms for k-Connected Graph Factors  13th
Approximation Algorithms for k-Connected Graph Factors
收藏 引用
13th International Workshop on approximation and Online algorithms (WAOA)
作者: Manthey, Bodo Waanders, Marten Univ Twente POB 217 NL-7500 AE Enschede Netherlands
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning sub graphs (or d-factor... 详细信息
来源: 评论