咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是521-530 订阅
排序:
approximation algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing  32
Approximation Algorithms for Hop Constrained and Buy-At-Bulk...
收藏 引用
32nd Annual European Symposium on algorithms, ESA 2024
作者: Chekuri, Chandra Jain, Rhea University of Illinois Urbana-ChampaignIL United States
We consider two-cost network design models in which edges of the input graph have an associated cost and length. We build upon recent advances in hop-constrained oblivious routing to obtain two sets of results. We add... 详细信息
来源: 评论
approximation algorithms for maximum cliques in 3D unit-disk graphs  17
Approximation algorithms for maximum cliques in 3D unit-disk...
收藏 引用
17th Canadian Conference on Computational Geometry, CCCG 2005
作者: Afshani, Peyman Chan, Timothy M. School of Computer Science University of Waterloo WaterlooONN2L 3G1 Canada
We study two problems for a given n-point set in 3-space: Finding a largest subset with diameter at most one, and finding a subset of k points with minimum diameter. For the former problem we suggest several polynomia... 详细信息
来源: 评论
approximation algorithms for aversion k-clustering via local k-median  43
Approximation algorithms for aversion k-clustering via local...
收藏 引用
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
作者: Gupta, Anupam Guruganesh, Guru Schmidt, Melanie Computer Science Department Carnegie Mellon University Pittsburgh United States Institute of Computer Science University of Bonn Bonn Germany
In the aversion k-clustering problem, given a metric space, we want to cluster the points into k clusters. The cost incurred by each point is the distance to the furthest point in its cluster, and the cost of the clus... 详细信息
来源: 评论
approximation algorithms for scheduling independent malleable tasks  7
收藏 引用
7th European Conference on Parallel Computing, Euro-Par 2001
作者: Machowiak, M. Trystram, D. Instytut Informatyki Politechnika Poznanska ul. Piotrowo 3a Poznan60-965 Poland ID-IMAG 51 rue Jean Kuntzman Montbonnot Saint Martin38330 France
Malleable tasks consist in considering the tasks of a parallel program as large computational units that may be themselves parallelized. In this paper we investigate the problem of scheduling a set of n independent ma... 详细信息
来源: 评论
approximation algorithms for the Maximum Bounded Connected Bipartition Problem  15th
Approximation Algorithms for the Maximum Bounded Connected...
收藏 引用
15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021
作者: Li, Yajie Li, Weidong Liu, Xiaofei Yang, Jinhua School of Mathematics and Statistics Yunnan University Kunming China School of Information Science and Engineering Yunnan University Kunming China Dianchi College Kunming China
In this paper, we study the maximum bounded connected bipartition problem (2-BCBP): given a vertex-weighted connected graph G= (V, E; w) and an upper bound B, the vertex set V is partitioned into two subsets denoted a... 详细信息
来源: 评论
approximation algorithms and a hardness result for the three-machine proportionate mixed shop  12th
Approximation algorithms and a hardness result for the three...
收藏 引用
12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018
作者: Liu, Longcheng Ni, Guanqun Chen, Yong Goebel, Randy Luo, Yue Zhang, An Lin, Guohui School of Mathematical Sciences Xiamen University Xiamen China College of Management Fujian Agriculture and Forestry University Fuzhou China Department of Mathematics Hangzhou Dianzi University Hangzhou China Department of Computing Science University of Alberta EdmontonAB Canada
A mixed shop is to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much harder than flow-shops and open-shops, and have been studied since the 1980’s. We consider ... 详细信息
来源: 评论
approximation algorithms for a directed network design problem  7th
收藏 引用
7th International Conference on Integer Programming and Combinatorial Optimization, IPCO 1999
作者: Melkonian, Vardges Tardos, Éva Cornell University IthacaNY14853 United States
We present a 2-approximation algorithm for a class of directed network design problems. The network design problem is to find a minimum cost subgraph such that for each vertex set S there are at least f(S) arcs leavin... 详细信息
来源: 评论
approximation algorithms for generalized TSP in grid clusters  9th
Approximation algorithms for generalized TSP in grid cluster...
收藏 引用
9th International Conference on Discrete Optimization and Operations Research, DOOR 2016
作者: Khachay, Michael Neznakhina, Katherine Krasovskii Institute of Mathematics and Mechanics Russia Ural Federal University Ekaterinburg Russia Omsk State Technical University Omsk Russia
The Generalized Traveling Salesman Problem (GTSP) is a generalization of the well known Traveling Salesman Problem (TSP), where along with a weighted graph G = (V, E, w) we are given by a partition of its node set V =... 详细信息
来源: 评论
approximation algorithms for schema-mapping discovery from data examples  9
Approximation algorithms for schema-mapping discovery from d...
收藏 引用
9th Alberto Mendelzon International Workshop on Foundations of Data Management, AMW 2015
作者: Ten Cate, Balder Kolaitis, Phokion G. Qian, Kun Tan, Wang-Chiew University of California Santa Cruz United States Logic Blox Inc. United States IBM Research Almaden United States
In recent years, data examples have been at the core of several different approaches to schema-mapping design. In particular, Gottlob and Senellart introduced a framework for schema-mapping discovery from a single dat... 详细信息
来源: 评论
approximation algorithms for spanner problems and Directed Steiner Forest
Approximation algorithms for spanner problems and Directed S...
收藏 引用
作者: Berman, Piotr Bhattacharyya, Arnab Makarychev, Konstantin Raskhodnikova, Sofya Yaroslavtsev, Grigory Pennsylvania State University University Park PA 16802 United States Princeton University Princeton NJ 08540 United States Microsoft Research Redmond WA 98052 United States
We present an O(√nlogn)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse subgraph that approximately preserves distan... 详细信息
来源: 评论