咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是401-410 订阅
排序:
approximation algorithms for minimum size 2-connectivity problems  18th
收藏 引用
18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001
作者: Krysta1, Piotr Anil Kumar, V.S. Max-Planck-Institut f¨ur Informatik Stuhlsatzenhausweg 85 SaarbrückenD-66123 Germany
We study some versions of the problem of finding the minimum size 2-connected subgraph. This problem is NP-hard (even on cubic planar graphs) and MAX SNP-hard. We show that the minimum 2-edge connected subgraph proble... 详细信息
来源: 评论
approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover
Approximation algorithms for stochastic boolean function eva...
收藏 引用
25th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2014
作者: Deshpande, Amol Hellerstein, Lisa Kletenik, Devorah University of Maryland United States Polytechnic Institute of NYU United States
We present approximation algorithms for two problems: Stochastic Boolean Function Evaluation (SBFE) and Stochastic Submodular Set Cover (SSSC). Our results for SBFE problems are obtained by reducing them to SSSC probl... 详细信息
来源: 评论
approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
收藏 引用
31st International Colloquium on Automata, Languages and Programming (ICALP 2004)
作者: Jothi, R Raghavachari, B Univ Texas Richardson TX 75083 USA
Given an undirected graph G = (V, E) with non-negative costs on its edges, a root node r is an element of V, a set of demands D subset of or equal to V with demand v is an element of D wishing to route w(v) units of f... 详细信息
来源: 评论
approximation algorithms for the discrete piercing set problem for unit disks
Approximation algorithms for the discrete piercing set probl...
收藏 引用
23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
作者: De, Minati Das, Gautam K. Nandy, Subhas C. Indian Statistical Institute Kolkata India Indian Institute of Technology Guwahati India
In this note, we shall consider constant factor approxi- mation algorithms for a variation of the discrete pierc- ing set problem for unit disks. Here a set of points P is given;the objective is to choose minimum numb... 详细信息
来源: 评论
approximation algorithms for demand strip packing  24
Approximation algorithms for demand strip packing
收藏 引用
24th International Conference on approximation algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021
作者: Gálvez, Waldo Grandoni, Fabrizio Ameli, Afrouz Jabal Khodamoradi, Kamyar Technische Universität München Germany IDSIA USI-SUPSI Lugano Switzerland Universitä Würzburg Germany
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, each characterized by a processing time and a demand for a given resource (such as electricity, computational power, e... 详细信息
来源: 评论
approximation algorithms for Maximum Matchings in Geometric Intersection Graphs  38
Approximation Algorithms for Maximum Matchings in Geometric ...
收藏 引用
38th International Symposium on Computational Geometry, SoCG 2022
作者: Har-Peled, Sariel Yang, Everett Department of Computer Science University of Illinois 201 N. Goodwin Avenue UrbanaIL61801 United States
We present a (1-e)-approximation algorithms for maximum cardinality matchings in disk intersection graphs - all with near linear running time. We also present an estimation algorithm that returns (1 ± e)-approxim... 详细信息
来源: 评论
approximation algorithms that take advice  3
收藏 引用
3rd International Workshop on approximation algorithms for Combinatorial Optimization, APPROX 2000
作者: Arora, Sanjeev Department of Computer Science Princeton University PrincetonNJ08544-2087 United States
Many recently designed approximation algorithms use a simple but apparently powerful idea. The algorithm is allowed to ask a trusted oracle for a small number (say O(log n)) bits of "advice." For instance, i... 详细信息
来源: 评论
approximation algorithms for node-weighted prize-collecting steiner tree problems on planar graphs  15
Approximation algorithms for node-weighted prize-collecting ...
收藏 引用
15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
作者: Byrka, Jaroslaw Lewandowski, Mateusz Moldenhauer, Carsten University of Wroclaw Wroclaw Poland EPFL Lausanne Switzerland
We study the prize-collecting version of the node-weighted Steiner tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for plan... 详细信息
来源: 评论
approximation algorithms for degree-constrained bipartite network flow
收藏 引用
18th International Symposium on Computer and Information Sciences (ISCIS 2003)
作者: Akçali, E Üngör, A Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Duke Univ Dept Comp Sci Durham NC 27708 USA
We consider a tool- and setup-constrained short-term capacity allocation problem that arises in operational level planning at a semiconductor wafer fabrication facility. We formulate this problem as a degree-constrain... 详细信息
来源: 评论
approximation algorithms for parallel machine scheduling with speed-up resources  19
Approximation algorithms for parallel machine scheduling wit...
收藏 引用
19th International Workshop on approximation algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016
作者: Chen, Lin Ye, Deshi Zhang, Guochuan Budapest Hungary Zhejiang University College of Computer Science Hangzhou China
We consider the problem of scheduling with renewable speed-up resources. Given m identical machines, n jobs and c different discrete resources, the task is to schedule each job non-preemptively onto one of the machine... 详细信息
来源: 评论