咨询与建议

限定检索结果

文献类型

  • 22,842 篇 会议
  • 9,117 篇 期刊文献
  • 64 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 16,011 篇 工学
    • 10,098 篇 计算机科学与技术...
    • 4,885 篇 电气工程
    • 3,122 篇 软件工程
    • 2,683 篇 信息与通信工程
    • 1,951 篇 控制科学与工程
    • 738 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 229 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 153 篇 测绘科学与技术
    • 134 篇 土木工程
    • 134 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,437 篇 理学
    • 9,372 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 737 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
    • 126 篇 地球物理学
  • 2,490 篇 管理学
    • 1,927 篇 管理科学与工程(可...
    • 674 篇 工商管理
    • 557 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 180 篇 法学
    • 167 篇 社会学
  • 128 篇 文学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,023 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,345 篇 optimization
  • 2,306 篇 approximation me...
  • 2,167 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,411 篇 convergence
  • 1,278 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,141 篇 signal processin...
  • 956 篇 computer science
  • 914 篇 polynomials
  • 909 篇 complexity theor...
  • 908 篇 clustering algor...
  • 789 篇 mathematical mod...
  • 752 篇 vectors
  • 712 篇 programming
  • 652 篇 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,298 篇 英文
  • 573 篇 其他
  • 113 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32023 条 记 录,以下是601-610 订阅
排序:
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
arXiv
收藏 引用
arXiv 2017年
作者: Altschuler, Jason Weed, Jonathan Rigollet, Philippe Massachusetts Institute of Technology
Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduction of several algorithms with go... 详细信息
来源: 评论
New subquadratic approximation algorithms for the girth
arXiv
收藏 引用
arXiv 2017年
作者: Dahlgaard, Søren Bæk Tejs Knudsen, Mathias Stöckel, Morten University of Copenhagen Denmark
We consider the problem of approximating the girth, g, of an unweighted and undirected graph G "pV, Eq with n nodes and m edges. A seminal result of Itai and Rodeh [SICOMP’78] gave an additive 1-approximation in... 详细信息
来源: 评论
Interpolating between k-median and k-center: approximation algorithms for ordered k-median
arXiv
收藏 引用
arXiv 2017年
作者: Chakrabarty, Deeparnab Swamy, Chaitanya Dept. of Computer Science Dartmouth College HanoverNH03755-3510 United States Dept. of Combinatorics and Optimization Univ. Waterloo WaterlooONN2L 3G1 Canada
We consider a generalization of k-median and k-center, called the ordered k-median problem. In this problem, we are given a metric space (D, {cij}) with n = |D| points, and a non-increasing weight vector w ∈ Rn+, and... 详细信息
来源: 评论
A Family of approximation algorithms for the Maximum Duo-Preservation String Mapping Problem
arXiv
收藏 引用
arXiv 2017年
作者: Dudek, Bartlomiej Gawrychowski, Pawel Ostropolski-Nalewaja, Piotr Institute of Computer Science University of Wroclaw Poland University of Haifa Israel
In the Maximum Duo-Preservation String Mapping problem we are given two strings and wish to map the letters of the former to the letters of the latter so as to maximise the number of duos. A duo is a pair of consecuti... 详细信息
来源: 评论
Parameterized approximation algorithms for some location problems in graphs
arXiv
收藏 引用
arXiv 2017年
作者: Leitert, Arne Dragan, Feodor F. Department of Computer Science Kent State University KentOH United States
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the (Connected) p-Center problem for unweighted and undirected graphs. Given a graph G, we... 详细信息
来源: 评论
Polylogarithmic approximation algorithms for weighted-F-deletion problems
arXiv
收藏 引用
arXiv 2017年
作者: Agrawal, Akanksha Lokshtanov, Daniel Misra, Pranabendu Saurabh, Saket Zehavi, Meirav University of Bergen Bergen Norway University of Bergen Bergen Norway Institute of Mathematical Sciences Chennai India University of Bergen Bergen Norway Institute of Mathematical Sciences HBNI Chennai India University of Bergen Bergen Norway
Let F be a family of graphs. A canonical vertex deletion problem corresponding to F is defined as follows: given an n-vertex undirected graph G and a weight function w: V (G) → R, find a minimum weight subset S ⊆ V (... 详细信息
来源: 评论
Constant approximation algorithms for guarding simple polygons using vertex guards
arXiv
收藏 引用
arXiv 2017年
作者: Bhattacharya, Pritam Ghosh, Subir Kumar Pal, Sudebkumar Prasant Department of Computer Science and Engineering Indian Institute of Technology Kharagpur West Bengal721302 India Department of Computer Science Rkm Vivekananda Educational and Research Institute Belur West Bengal711202 India
The art gallery problem enquires about the least number of guards sufficient to ensure that an art gallery, represented by a simple polygon P, is fully guarded. Most standard versions of this problem are known to be N... 详细信息
来源: 评论
Experimental Evaluation of approximation algorithms for Maximum Distance-Bounded Subgraph Problems  8
Experimental Evaluation of Approximation Algorithms for Maxi...
收藏 引用
Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) / 17th International Symposium on Advanced Intelligent Systems (ISIS)
作者: Asahiro, Yuichi Kubo, Tomohiro Miyano, Eiji Kyushu Sangyo Univ Dept Informat Sci Fukuoka 8138503 Japan Kyushu Inst Technol Dept Syst Design & Informat Fukuoka 8208502 Japan
In this paper we consider two distance-based relaxed variants of the maximum clique problem (MAX CLIQUE), named MAX d-CLIQUE and MAX d-CLUB: A d-clique in a graph G is a subset S subset of V (G) of vertices such that ... 详细信息
来源: 评论
approximation algorithms for Energy, Reliability, and Makespan Optimization Problems
收藏 引用
PARALLEL PROCESSING LETTERS 2016年 第1期26卷 1650001-1650001页
作者: Aupy, Guillaume Benoit, Anne Ecole Normale Super Lyon LIP 46 Allee Italie F-69364 Lyon 07 France
We consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is mad... 详细信息
来源: 评论
Improved approximation algorithms for Hitting 3-Vertex Paths  18th
Improved Approximation Algorithms for Hitting 3-Vertex Paths
收藏 引用
18th International Conference on Integer Programming and Combinatorial Optimization (IPCO)
作者: Fiorini, Samuel Joret, Gwenael Schaudt, Oliver Univ Libre Bruxelles Dept Math Brussels Belgium Univ Libre Bruxelles Dept Informat Brussels Belgium Univ Cologne Inst Informat Cologne Germany
We study the problem of deleting a minimum cost set of vertices from a given vertex-weighted graph in such a way that the resulting graph has no induced path on three vertices. This problem is often called cluster ver... 详细信息
来源: 评论