咨询与建议

限定检索结果

文献类型

  • 22,830 篇 会议
  • 9,106 篇 期刊文献
  • 62 篇 学位论文
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

  • 31,999 篇 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,275 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31999 条 记 录,以下是671-680 订阅
排序:
Improved approximation algorithms for the Maximum Happy Vertices and Edges Problems  21st
Improved Approximation Algorithms for the Maximum Happy Vert...
收藏 引用
21st International Computing and Combinatorics Conference (COCOON)
作者: Zhang, Peng Jiang, Tao Li, Angsheng Shandong Univ Sch Comp Sci & Technol Jinan 250101 Peoples R China Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA Tsinghua Univ TNLIST Dept Comp Sci & Technol MOE Key Lab Bioinformat Beijing 100084 Peoples R China Tsinghua Univ TNLIST Dept Comp Sci & Technol Bioinformat Div Beijing 100084 Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100190 Peoples R China
The Maximum Happy Vertices (MHV) problem and the Maximum Happy Edges (MHE) problem are two fundamental problems arising in the study of the homophyly phenomenon in large scale networks. Both of these two problems are ... 详细信息
来源: 评论
Improved approximation algorithms for Stochastic Matching  1
收藏 引用
23rd Annual European Symposium on algorithms (ESA) as part of ALGO Conference
作者: Adamczyk, Marek Grandoni, Fabrizio Mukherjee, Joydeep Univ Roma La Sapienza Dept Comp Control & Management Engn Rome Italy Univ Lugano IDSIA Lugano Switzerland CIT Inst Math Sci Coimbatore Tamil Nadu India
In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of exi... 详细信息
来源: 评论
Optimal approximation algorithms for Maximum Distance-Bounded Subgraph Problems  9th
Optimal Approximation Algorithms for Maximum Distance-Bounde...
收藏 引用
9th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Asahiro, Yuichi Doi, Yuya Miyano, Eiji Shimizu, Hirotaka Kyushu Sangyo Univ Dept Informat Sci Fukuoka 8138503 Japan Kyushu Inst Technol Dept Syst Design & Informat Fukuoka 8208502 Japan
A d-clique in a graph G = (V, E) is a subset S subset of V of vertices such that for pairs of vertices u, v is an element of S, the distance between u and v is at most d in G. A d-club in a graph G = (V, E) is a subse... 详细信息
来源: 评论
Computing stable coalitions: approximation algorithms for reward sharing  1
收藏 引用
11th International Conference on Web and Internet Economics, WINE 2015
作者: Anshelevich, Elliot Sekar, Shreyas Rensselaer Polytechnic Institute TroyNY United States
Consider a setting where selfish agents are to be assigned to coalitions or projects from a set P. Each project k ∈ P is characterized by a valuation function;vk(S) is the value generated by a set S of agents working... 详细信息
来源: 评论
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
Iterative rounding approximation algorithms for degree-bound...
收藏 引用
作者: Fukunaga, Takuro Nutov, Zeev Ravi, R. National Institute of Informatics Japan JST ERATO Kawarabayashi Large Graph Project Tokyo101-8430 Japan Open University of Israel Raanana43107 Israel Carnegie Mellon University PittsburghPA15213 United States
We consider the problem of finding a minimum edge cost subgraph of a graph satisfying both given node-connectivity requirements and degree upper bounds on nodes. We present an iterative rounding algorithm of the biset... 详细信息
来源: 评论
Bayesian truthful mechanisms for job scheduling from bi-criterion approximation algorithms  26
Bayesian truthful mechanisms for job scheduling from bi-crit...
收藏 引用
26th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2015
作者: Daskalakis, Constantinos Weinberg, S. Matthew EECS MIT United States
We provide polynomial-time approximately optimal Bayesian mechanisms for makespan minimization on unrelated machines as well as for max-min fair allocations of indivisible goods, with approximation factors of 2 and mi... 详细信息
来源: 评论
Exact and approximation algorithms for data mule scheduling in a sensor network  11th
Exact and approximation algorithms for data mule scheduling ...
收藏 引用
11th International Symposium on algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015
作者: Citovsky, Gui Gao, Jie Mitchell, Joseph S.B. Zeng, Jiemin Stony Brook University Stony BrookNY United States
We consider the fundamental problem of scheduling data mules for managing a wireless sensor network. A data mule tours around a sensor network and can help with network maintenance such as data collection and battery ... 详细信息
来源: 评论
LP-based approximation algorithms for facility location in buy-at-bulk network design  14th
LP-based approximation algorithms for facility location in b...
收藏 引用
14th International Symposium on algorithms and Data Structures, WADS 2015
作者: Friggstad, Zachary Rezapour, Mohsen Salavatipour, Mohammad R. Soto, José A. Department of Computing Science University of Alberta EdmontonAB Canada Institute for Mathematics TU Berlin Berlin Germany DIM and CMM Universidad de Chile Santiago Chile
We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client deman... 详细信息
来源: 评论
approximation algorithms for the Generalized Multiple Knapsack Problems with K Restricted Elements
Approximation Algorithms for the Generalized Multiple Knapsa...
收藏 引用
International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC
作者: Binchao Huang Jianping Li Ko-Wei Lih Haiyan Wang Department of Mathematics Yunnan University Kunming China Institute of Mathematics Academia Sinica Taipei Taiwan School of Statistics and Mathematics Yunnan University of Finance and Economics Kunming China
We are given a set of items, and a set of knapsacks. Both the weight and the profit of an item are functions of the knapsack, and each knapsack has a positive real capacity. A restriction is setting that the number of... 详细信息
来源: 评论
approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 526卷 90-96页
作者: Kumar, Mrinal Mishra, Sounaka Devi, N. Safina Saurabh, Saket Indian Inst Technol Madras Madras Tamil Nadu India Inst Math Sci Madras Tamil Nadu India
In this paper, we develop approximation algorithms for a few node deletion problems when the input is restricted to be a bipartite graph. We look at node deletion problems for non-trivial properties which can be chara... 详细信息
来源: 评论