咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是171-180 订阅
approximation algorithms for the a priori traveling repairman
收藏 引用
OPERATIONS RESEARCH LETTERS 2020年 第5期48卷 599-606页
作者: Navidi, Fatemeh Li Gortz, Inge Nagarajan, Viswanath Univ Michigan Ann Arbor MI 48109 USA Tech Univ Denmark DTU Compute Lyngby Denmark
We consider the a priori traveling repairman problem, which is a stochastic version of the classic traveling repairman problem. Given a metric (V, d) with a root r is an element of V, the traveling repairman problem (... 详细信息
来源: 评论
approximation algorithms for the twin robot scheduling problem
收藏 引用
JOURNAL OF SCHEDULING 2020年 第1期23卷 117-133页
作者: Jaehn, Florian Wiehl, Andreas Helmut Schmidt Univ Management Sci & Operat Res Holstenhofweg 85 D-22043 Hamburg Germany Stettenstr 28 D-86150 Augsburg Germany
We consider the NP-hard twin robot scheduling problem, which was introduced by Erdogan et al. (Naval Res Logist (NRL) 61(2):119-130, 2014). Here, two moving robots positioned at the opposite ends of a rail have to per... 详细信息
来源: 评论
Parameterized approximation algorithms for K-center Clustering and Variants  36
Parameterized Approximation Algorithms for K-center Clusteri...
收藏 引用
36th AAAI Conference on Artificial Intelligence / 34th Conference on Innovative Applications of Artificial Intelligence / 12th Symposium on Educational Advances in Artificial Intelligence
作者: Bandyapadhyay, Sayan Friggstad, Zachary Mousavi, Ramin Univ Bergen Dept Informat Bergen Norway Univ Alberta Dept Comp Sci Edmonton AB Canada
k-center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean version is NP-hard to approximate within a factor of 1.93, even in t... 详细信息
来源: 评论
Parameterized approximation algorithms for weighted vertex cover
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 1021卷
作者: Mandal, Soumen Misra, Pranabendu Rai, Ashutosh Saurabh, Saket IIT Delhi Dept Math New Delhi India Chennai Math Inst Chennai India Inst Math Sci Chennai India Univ Bergen Bergen Norway
A vertex cover of a graph is a set of vertices of the graph such that every edge has at least one endpoint in it. In this work, we study Weighted Vertex Cover with solution size as a parameter. Formally, in the (k, W)... 详细信息
来源: 评论
approximation algorithms for Training One-Node ReLU Neural Networks
收藏 引用
IEEE TRANSACTIONS ON SIGNAL PROCESSING 2020年 68卷 6696-6706页
作者: Dey, Santanu S. Wang, Guanyi Xie, Yao Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30342 USA
Training a one-node neural network with the ReLU activation function via optimization, which we refer to as the ON-ReLU problem, is a fundamental problem in machine learning. In this paper, we begin by proving the NP-... 详细信息
来源: 评论
approximation algorithms for the Min-Max Cycle Cover Problem With Neighborhoods
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2020年 第4期28卷 1845-1858页
作者: Deng, Lijia Xu, Wenzheng Liang, Weifa Peng, Jian Zhou, Yingjie Duan, Lei Das, Sajal K. Sichuan Univ Coll Comp Sci Chengdu 610065 Peoples R China Australian Natl Univ Res Sch Comp Sci Canberra ACT 2601 Australia Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA
In this paper we study the min-max cycle cover problem with neighborhoods, which is to find a given number of K cycles to collaboratively visit n Points of Interest (POIs) in a 2D space such that the length of the lon... 详细信息
来源: 评论
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 990卷
作者: Acharyya, Ankush Keikha, Vahideh Majumdar, Diptapriyo Pandit, Supantha Natl Inst Technol Dept Comp Sci & Engn Durgapur India Czech Acad Sci Inst Comp Sci Prague Czech Republic Indraprastha Inst Informat Technol Delhi New Delhi India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India
We study a constrained version of the GEOMETRIC HITTING SET problem where we are given a set of points, partitioned into pairwise disjoint subsets, and a set of intervals. The objective is to hit all the intervals wit... 详细信息
来源: 评论
Almost Tight approximation algorithms for Explainable Clustering  33
Almost Tight Approximation Algorithms for Explainable Cluste...
收藏 引用
Annual ACM-SIAM Symposium on Discrete algorithms (SODA)
作者: Esfandiari, Hossein Mirrokni, Vahab Narayanan, Shyam Google Res Mountain View CA 94043 USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA
Recently, due to an increasing interest for transparency in artificial intelligence, several methods of explainable machine learning have been developed with the simultaneous goal of accuracy and interpretability by h... 详细信息
来源: 评论
Improved approximation algorithms for Individually Fair Clustering  25
Improved Approximation Algorithms for Individually Fair Clus...
收藏 引用
International Conference on Artificial Intelligence and Statistics
作者: Vakilian, Ali Yalciner, Mustafa Toyota Technol Inst Chicago TTIC Chicago IL 60637 USA Tech Univ Dortmund Dortmund Germany
We consider the k-clustering problem with l(p)-norm cost, which includes k-median, kmeans and k-center, under an individual notion of fairness proposed by Jung et al. [2020]: given a set of points P of size n, a set o... 详细信息
来源: 评论
Additive approximation algorithms for modularity maximization
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2021年 117卷 182-201页
作者: Kawase, Yasushi Matsui, Tomomi Miyauchi, Atsushi Univ Tokyo Grad Sch Informat Sci & Technol Bunkyo Ku Hongo 7-3-1 Tokyo 1138656 Japan Tokyo Inst Technol Sch Engn Meguro Ku Ookayama 2-12-1 Tokyo 1528552 Japan
The modularity is the best known and widely used quality function for community detection in graphs. We investigate the approximability of the modularity maximization problem and some related problems. We first design... 详细信息
来源: 评论