咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是481-490 订阅
排序:
approximation algorithms and hardness results for cycle packing problems
Approximation algorithms and hardness results for cycle pack...
收藏 引用
作者: Krivelevich, Michael Nutov, Zeev Salavatipour, Mohammad R. Yuster, Jacques Verstraete Yuster, Raphael Tel Aviv University Open University of Israel University of Alberta University of Waterloo University of Haifa Department of Mathematics Tel Aviv University Tel Aviv Israel Department of Computer Science The Open University of Israel Tel Aviv Israel Department of Computing Science University of Alberta Edmonton Alta. T6G2E8 Canada Department of Combinatorics and Optimization University of Waterloo Ont. N2L3G1 Canada Department of Mathematics University of Haifa Haifa 31905 Israel
The cycle packing number ve(G) of a graph G is the maximum number of pairwise edgedisjointcycles in G. Computing ve(G) is an NP-hard *** present approximation algorithms for computing v e(G) in both undirected and dir... 详细信息
来源: 评论
approximation algorithms for time constrained scheduling  2nd
Approximation algorithms for time constrained scheduling
收藏 引用
2nd International Workshop on Parallel algorithms for Irregularly Structured Problems, IRREGULAR 1995
作者: Jansen, Klaus Ohring, Sabine Institut für Informatik Technische Universits Mfinchen Arcisstr. 21 Mfinchen80 290 Germany Department of Computer Science University of North Texas DentonTX76203-3886 United States
In this paper we consider the following time constrained scheduling problem. Given a set of jobs J with execution times e(j) E (0, 1] and an undirected graph G = (J, E), we consider the problem to find a schedule for ... 详细信息
来源: 评论
approximation algorithms for stochastic k-TSP  37
Approximation algorithms for stochastic k-TSP
收藏 引用
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017
作者: Ene, Alina Nagarajan, Viswanath Saket, Rishi Computer Science Department Boston University Boston United States Industrial and Operations Engineering Department University of Michigan Ann Arbor United States IBM Research India Bangalore India
This paper studies the stochastic variant of the classical k-TSP problem where rewards at the vertices are independent random variables which are instantiated upon the tour’s visit. The objective is to minimize the e... 详细信息
来源: 评论
approximation algorithms for a combined facility location buy-at-bulk network design problem
Approximation algorithms for a combined facility location bu...
收藏 引用
10th International Conference on Theory and Applications of Models of Computation, TAMC 2013
作者: Bley, Andreas Hashemi, S. Mehdi Rezapour, Mohsen Institute for Mathematics TU Berlin Straße des 17. Juni 136 10623 Berlin Germany Department of Computer Science Amirkabir University of Technology No. 424 Hafez Ave. Tehran Iran
We consider a generalization of the connected facility location problem where the clients must be connected to the open facilities via shared capacitated (tree) networks instead of independent shortest paths. This pro... 详细信息
来源: 评论
approximation algorithms for minimizing the number of roles and administrative assignments in RBAC
Approximation algorithms for minimizing the number of roles ...
收藏 引用
36th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2012
作者: Huang, Hejiao Shang, Feng Zhang, Jiangtao Harbin Institute of Technology Shenzhen Graduate School China
In role based access control (RBAC), minimizing the descriptive set of roles (specified as Basic-RMP) and minimizing the administrative assignments for roles (specified as Edge-RMP) can greatly decrease the management... 详细信息
来源: 评论
approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode  9th
收藏 引用
9th Annual European Symposium on algorithms, ESA 2001
作者: Fraigniaud, Pierre CNRS-LRI Université Paris-Sud France
We give a polynomial-time(formula presented)-approximation algorithm for minimum-time broadcast and minimum-time multicast in n-node networks under the single-port vertex-disjoint paths mode. This improves a previous ... 详细信息
来源: 评论
approximation algorithms for Orthogonal Line Centers  7th
Approximation Algorithms for Orthogonal Line Centers
收藏 引用
7th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2021
作者: Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Indian Statistical Institute Kolkata India Ramakrishna Mission Vivekananda Educational and Research Institute Howrah India
k orthogonal line center problem computes a set of k axis-parallel lines for a given set of points in 2D such that the maximum among the distance between each point to its nearest line is minimized. A 2-factor approxi... 详细信息
来源: 评论
approximation algorithms for routing and call scheduling in all-optical chains and rings  19th
收藏 引用
19th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTandTCS 1999
作者: Becchetti, Luca Di Ianni, Miriam Marchetti-Spaccamela, Alberto Technische Universität Graz Institut für Mathematik B Austria Dipartimento di Ingegneria Elettronica e dell’Informazione Università di Perugia Italy Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Italy
We study the problem of routing and scheduling requests of limited durations in an all-optical network. The task is servicing the requests, assigning each of them a starting time and a wavelength, with restrictions on... 详细信息
来源: 评论
approximation algorithms for finding best viewpoints  6th
收藏 引用
6th International Symposium on Graph Drawing, GD 1998
作者: Houle, Michael E. Webber, Richard Department of Computer Science and Software Engineering University of Newcastle Callaghan2308 Australia
We address the problem of finding viewpoints that preserve the relational structure of a three-dimensional graph drawing under orthographic parallel projection. Previously, algorithms for finding the best viewpoints u... 详细信息
来源: 评论
approximation algorithms for connected dominating sets  4th
Approximation algorithms for connected dominating sets
收藏 引用
4th European Symposium on algorithms, ESA 1996
作者: Guha, Sudipto Khuller, Samir Dept. of Computer Science University of Maryland College ParkMD20742 United States Dept. of Computer Science and UMIACS University of Maryland College ParkMD20742 United States
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to at least one node in the dominati... 详细信息
来源: 评论