咨询与建议

限定检索结果

文献类型

  • 22,935 篇 会议
  • 9,257 篇 期刊文献
  • 50 篇 学位论文

馆藏范围

  • 32,242 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 16,166 篇 工学
    • 10,225 篇 计算机科学与技术...
    • 4,934 篇 电气工程
    • 3,195 篇 软件工程
    • 2,715 篇 信息与通信工程
    • 1,960 篇 控制科学与工程
    • 741 篇 机械工程
    • 684 篇 电子科学与技术(可...
    • 608 篇 航空宇航科学与技...
    • 541 篇 仪器科学与技术
    • 235 篇 交通运输工程
    • 214 篇 材料科学与工程(可...
    • 196 篇 化学工程与技术
    • 170 篇 生物工程
    • 160 篇 测绘科学与技术
    • 140 篇 土木工程
    • 135 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,522 篇 理学
    • 9,446 篇 数学
    • 884 篇 物理学
    • 769 篇 系统科学
    • 751 篇 统计学(可授理学、...
    • 266 篇 生物学
    • 238 篇 化学
    • 127 篇 地球物理学
  • 2,506 篇 管理学
    • 1,936 篇 管理科学与工程(可...
    • 678 篇 工商管理
    • 564 篇 图书情报与档案管...
  • 420 篇 经济学
    • 389 篇 应用经济学
  • 212 篇 医学
    • 175 篇 临床医学
  • 182 篇 法学
    • 169 篇 社会学
  • 129 篇 文学
  • 129 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,242 篇 approximation al...
  • 2,736 篇 algorithm design...
  • 2,379 篇 optimization
  • 2,305 篇 approximation me...
  • 2,189 篇 heuristic algori...
  • 1,429 篇 linear programmi...
  • 1,425 篇 convergence
  • 1,292 篇 computational mo...
  • 1,229 篇 resource managem...
  • 1,149 篇 signal processin...
  • 956 篇 computer science
  • 924 篇 polynomials
  • 921 篇 clustering algor...
  • 920 篇 complexity theor...
  • 788 篇 mathematical mod...
  • 763 篇 vectors
  • 711 篇 programming
  • 659 篇 estimation
  • 634 篇 training
  • 614 篇 transportation

机构

  • 97 篇 univ maryland de...
  • 66 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 48 篇 cornell univ dep...
  • 44 篇 tsinghua univers...
  • 39 篇 carnegie mellon ...
  • 38 篇 national institu...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 32 篇 nanjing univ sta...
  • 31 篇 school of comput...
  • 29 篇 hong kong polyte...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 epfl
  • 28 篇 tel aviv univers...

作者

  • 65 篇 woodruff david p...
  • 63 篇 ravi r.
  • 52 篇 kortsarz guy
  • 45 篇 lee euiwoong
  • 43 篇 levin asaf
  • 42 篇 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
  • 28 篇 saha barna
  • 28 篇 dinitz michael
  • 27 篇 shmoys david b.

语言

  • 30,821 篇 英文
  • 1,287 篇 其他
  • 116 篇 中文
  • 9 篇 日文
  • 8 篇 俄文
  • 3 篇 法文
  • 2 篇 西班牙文
  • 1 篇 土耳其文
  • 1 篇 乌克兰文
检索条件"主题词=Approximation algorithms"
32242 条 记 录,以下是111-120 订阅
排序:
Faster approximation algorithms for Parameterized Graph Clustering and Edge Labeling  23
Faster Approximation Algorithms for Parameterized Graph Clus...
收藏 引用
32nd ACM International Conference on Information and Knowledge Management (CIKM)
作者: Bengali, Vedangi Veldt, Nate Texas A&M Univ College Stn TX 77843 USA
Graph clustering is a fundamental task in network analysis where the goal is to detect sets of nodes that are well-connected to each other but sparsely connected to the rest of the graph. We present faster approximati... 详细信息
来源: 评论
A Framework to Design approximation algorithms for Finding Diverse Solutions in Combinatorial Problems  37
A Framework to Design Approximation Algorithms for Finding D...
收藏 引用
37th AAAI Conference on Artificial Intelligence (AAAI) / 35th Conference on Innovative Applications of Artificial Intelligence / 13th Symposium on Educational Advances in Artificial Intelligence
作者: Hanaka, Tesshu Kiyomi, Masashi Kobayashi, Yasuaki Kobayashi, Yusuke Kurita, Kazuhiro Otachi, Yota Kyushu Univ Fukuoka Japan Seikei Univ Musashino Tokyo Japan Hokkaido Univ Sapporo Hokkaido Japan Kyoto Univ Kyoto Japan Nagoya Univ Nagoya Aichi Japan
Finding a single best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints a... 详细信息
来源: 评论
Constant-Factor approximation algorithms for Convex Cover and Hidden Set in a Simple Polygon  64
Constant-Factor Approximation Algorithms for Convex Cover an...
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Browne, Reilly Kasthurirangan, Prahlad Narasimham Mitchell, Joseph S. B. Polishchuk, Valentin SUNY Stony Brook Stony Brook NY 11794 USA Linkoping Univ Linkoping Sweden
Given a simple polygon P, the minimum convex cover problem seeks to cover P with the fewest convex polygons that lie within P. The maximum hidden set problem seeks to place within P a maximum cardinality set of points... 详细信息
来源: 评论
approximation algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
arXiv
收藏 引用
arXiv 2024年
作者: Chekuri, Chandra Jain, Rhea Dept. of Computer Science Univ. of Illinois Urbana-Champaign UrbanaIL61801 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 School Assignment: Group Fairness and Multi-criteria Optimization
arXiv
收藏 引用
arXiv 2024年
作者: Santhini, K.A. Munagala, Kamesh Nasre, Meghana Sankar, Govind S. Indian Institute of Technology Madras India Duke University United States
We consider the problem of assigning students to schools, when students have different utilities for schools and schools have capacity. There are additional group fairness considerations over students that can be capt... 详细信息
来源: 评论
Fast (1+ε)-approximation algorithms for Binary Matrix Factorization  40
Fast (1+ε)-Approximation Algorithms for Binary Matrix Facto...
收藏 引用
40th International Conference on Machine Learning
作者: Velingker, Ameya Votsch, Maximilian Woodruff, David P. Zhou, Samson Google Res Mountain View CA USA Univ Vienna Doctoral Sch Comp Sci DoCS Vienna Austria Univ Vienna Fac Comp Sci Vienna Austria Carnegie Mellon Univ Pittsburgh PA 15213 USA Google Pittsburgh PA USA Univ Calif Berkeley Berkeley CA 94720 USA Rice Univ Houston TX 77005 USA
We introduce efficient (1 + epsilon)-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix A is an element of{0, 1}(nxd), a rank parameter k > 0, as well as an ac... 详细信息
来源: 评论
Optimal LP Rounding and Linear-Time approximation algorithms for Clustering Edge-Colored Hypergraphs  40
Optimal LP Rounding and Linear-Time Approximation Algorithms...
收藏 引用
40th International Conference on Machine Learning
作者: Veldt, Nate Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA
We study the approximability of an existing framework for clustering edge-colored hypergraphs, which is closely related to chromatic correlation clustering and is motivated by machine learning and data mining applicat... 详细信息
来源: 评论
approximation algorithms for Minimizing Congestion in Demand-Aware Networks
Approximation Algorithms for Minimizing Congestion in Demand...
收藏 引用
IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies
作者: Wenkai Dai Michael Dinitz Klaus-Tycho Foerster Long Luo Stefan Schmid Faculty of Computer Science and UniVie Doctoral School Computer Science DoCS University of Vienna Austria Department of Computer Science Johns Hopkins University USA Department of Computer Science TU Dortmund Germany University of Electronic Science and Technology of China P.R. China TU Berlin Germany University of Vienna Austria
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optim... 详细信息
来源: 评论
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
收藏 引用
Journal of Graph algorithms and Applications 2022年 第2期26卷 209-224页
作者: Biniaz, Ahmad School of Computer Science University of Windsor Windsor Canada
Given a connected vertex-weighted graph G, the maximum weight internal spanning tree (MaxwIST) problem asks for a spanning tree of G that maximizes the total weight of internal nodes. This problem is NP-hard and APX-h... 详细信息
来源: 评论
approximation algorithms for Socially Fair Clustering  34
Approximation Algorithms for Socially Fair Clustering
收藏 引用
Conference on Learning Theory (COLT)
作者: Makarychev, Yury Vakilian, Ali Toyota Technol Inst 6045 S Kenwood Ave Chicago IL 60637 USA
We present an (e(O(p)) log l/log log l)-approximation algorithm for socially fair clustering with the l(p)-objective. In this problem, we are given a set of points in a metric space. Each point belongs to one (or seve... 详细信息
来源: 评论