咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是561-570 订阅
排序:
Hardness results and approximation algorithms of k-tuple domination in graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2004年 第2期89卷 75-83页
作者: Klasing, R Laforest, C Univ Evry LaMI F-91000 Evry France Univ Nice INRIA CNRS MASCOTTE Project F-06902 Sophia Antipolis France
In a graph G, a vertex is said to dominate itself and all of its neighbors. Adominating set of G = (V, E) is a subset D of V such that every vertex in V is dominated by atleast one vertex in D. Domination and its vari... 详细信息
来源: 评论
Exact and approximation algorithms for weighted matroid intersection
收藏 引用
MATHEMATICAL PROGRAMMING 2019年 第1-2期177卷 85-112页
作者: Huang, Chien-Chung Kakimura, Naonori Kamiyama, Naoyuki PSL Ecole Normale Super CNRS Paris France Keio Univ Dept Math Yokohama Kanagawa Japan Kyushu Univ Inst Math Ind Fukuoka Fukuoka Japan
In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our a... 详细信息
来源: 评论
On approximation algorithms for concave mixed-integer quadratic programming
收藏 引用
MATHEMATICAL PROGRAMMING 2018年 第1-2期172卷 3-16页
作者: Del Pia, Alberto Univ Wisconsin Wisconsin Inst Discovery Dept Ind & Syst Engn Madison WI 53706 USA
Concave mixed- integer quadratic programming is the problem of minimizing a concave quadratic polynomial over the mixed- integer points in a polyhedral region. In this work we describe an algorithm that finds an - app... 详细信息
来源: 评论
approximation algorithms to minimum vertex cover problems on polygons and terrains
Approximation algorithms to minimum vertex cover problems on...
收藏 引用
International Conference on Computational Science, ICCS 2003
作者: Tomás, Ana Paula Bajuelos, António Leslie Marques, Fábio DCC-FC & LIACC University of Porto Portugal Department of Mathematics / R & D Unit "Mathematics and Applications" University of Aveiro Portugal School of Technology and Management University of Aveiro Portugal
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may be directly extended to terrains along... 详细信息
来源: 评论
The maximum congested cut problem and its robust counterpart:: Exact and approximation algorithms for the single and the multicommodity case
收藏 引用
NETWORKS 2008年 第2期51卷 102-112页
作者: Scutella, Maria G. Univ Pisa Dipartimento Informat Pisa Italy
We study an optimization problem which can be interesting in several network applications, especially in telecommunication. Given a capacitated directed network G in which a flow, related to a certain commodity, has t... 详细信息
来源: 评论
Near Optimal Online algorithms and Fast approximation algorithms for Resource Allocation Problems
收藏 引用
JOURNAL OF THE ACM 2019年 第1期66卷 1-41页
作者: Devanur, Nikhil R. Jain, Kamal Sivan, Balasubramanian Wilkens, Christopher A. Microsoft Res 1 Microsoft Way Redmond WA 98052 USA Faira 608 State St S Kirkland WA 98033 USA Google Res 111 8th Ave New York NY 10011 USA Facebook Res 1 Hacker Way Menlo Pk CA 94025 USA
We present prior robust algorithms for a large class of resource allocation problems where requests arrive one-by-one (online), drawn independently from an unknown distribution at every step. We design a single algori... 详细信息
来源: 评论
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2023年 133卷 23-40页
作者: Einarson, Carl Gutin, Gregory Jansen, Bart M. P. Majumdar, Diptapriyo Wahlstrom, Magnus Royal Holloway Univ London Egham Surrey England Eindhoven Univ Technol Eindhoven Netherlands Indraprastha Inst Informat Technol Delhi New Delhi India
We introduce and study two natural generalizations of the Connected Vertex Cover (VC) problem: the p-Edge-Connected and p-Vertex-Connected VC problem (where p >= 2 is a fixed integer). We obtain an 2O(pk)nO(1)-time... 详细信息
来源: 评论
Primal-dual approximation algorithms for a packing-covering pair of problems
收藏 引用
RAIRO-OPERATIONS RESEARCH 2002年 第1期36卷 53-71页
作者: Kovaleva, S Spieksma, FCR Maastricht Univ Dept Math NL-6200 MD Maastricht Netherlands Katholieke Univ Leuven Dept Appl Econ B-3000 Louvain Belgium
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the probl... 详细信息
来源: 评论
Improved approximation algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
收藏 引用
ALGORITHMICA 2024年 第8期86卷 2575-2604页
作者: Bansal, Ishan Cheriyan, Joseph Grout, Logan Ibrahimpur, Sharat Cornell Univ Operat Res & Informat Engn Ithaca NY USA Univ Waterloo Dept Combinator & Optimizat Waterloo ON Canada London Sch Econ & Polit Sci Dept Math London England
We address long-standing open questions raised by Williamson, Goemans, Vazirani and Mihail pertaining to the design of approximation algorithms for problems in network design via the primal-dual method (Williamson et ... 详细信息
来源: 评论
A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
收藏 引用
OPTIMIZATION LETTERS 2014年 第4期8卷 1201-1212页
作者: Qiu, Jiaming Sharkey, Thomas C. Rensselaer Polytech Inst Dept Ind & Syst Engn Troy NY 12180 USA
We consider a new dynamic edge covering and scheduling problem that focuses on assigning resources to nodes in a network to minimize the amount of time required to process all edges in it. Resources need to be co-loca... 详细信息
来源: 评论