咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是661-670 订阅
排序:
New approximation algorithms for Minimum Cycle Bases of Graphs
收藏 引用
ALGORITHMICA 2011年 第4期59卷 471-488页
作者: Kavitha, Telikepalli Mehlhorn, Kurt Michail, Dimitrios Max Planck Inst Informat D-66123 Saarbrucken Germany Indian Inst Sci Bangalore 560012 Karnataka India
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices;the extension to directed graphs is also discussed. In this probl... 详细信息
来源: 评论
An alternative proof for convergence of stochastic approximation algorithms
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1996年 第3期41卷 419-424页
作者: Kulkarni, SR Horn, CS Department of Electrical Engineering. Princeton University
An alternative proof for convergence of stochastic approximation algorithms is provided. The proof is completely deterministic, very elementary (involving only basic notions of convergence), and direct in that it rema... 详细信息
来源: 评论
Parallel approximation algorithms for maximum weighted matching in general graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2000年 第1-2期76卷 13-17页
作者: Uehara, R Chen, ZZ Komazawa Univ Fac Nat Sci Setagaya Ku Tokyo 154 Japan Tokyo Denki Univ Dept Math Sci Tokyo 101 Japan
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents two parallel approximation algorithms for this problem. The first is an RNC... 详细信息
来源: 评论
Some approximation algorithms for the clique partition problem in weighted interval graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2007年 第1-3期381卷 124-133页
作者: Chen, Mingxia Li, Jianbo Li, Jianping Li, Weidong Wang, Lusheng Yunnan Univ Dept Sci & Technol Kunming 650091 Peoples R China Kunming Univ Sci & Technol Sch Management & Econ Kunming 650090 Peoples R China Yunnan Univ Dept Math Kunming 650091 Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
Interval graphs play important roles in analysis of DNA chains in Benzer [S. Benzer, On the topology of the genetic fine structure, Proceedings of the National Academy of Sciences of the United States of America 45 (1... 详细信息
来源: 评论
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
收藏 引用
JOURNAL OF algorithms 2002年 第1期43卷 138-152页
作者: Gaur, DR Ibaraki, T Krishnamurti, R Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem. we are given a set of rectangles... 详细信息
来源: 评论
Analysis of approximation algorithms for k-Set Cover Using Factor-Revealing Linear Programs
收藏 引用
THEORY OF COMPUTING SYSTEMS 2009年 第3期45卷 555-576页
作者: Athanassopoulos, Stavros Caragiannis, Ioannis Kaklamanis, Christos Univ Patras Res Acad Comp Technol Inst Rion 26500 Greece Univ Patras Dept Comp Engn & Informat Rion 26500 Greece
We present new combinatorial approximation algorithms for the k-set cover problem. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new algorithms further extend ... 详细信息
来源: 评论
Efficient approximation algorithms for the achromatic number
收藏 引用
THEORETICAL COMPUTER SCIENCE 2006年 第2-3期361卷 150-171页
作者: Krysta, Piotr Lorys, Krzysztof Univ Dortmund Dept Comp Sci D-44221 Dortmund Germany Univ Wroclaw Inst Comp Sci PL-51151 Wroclaw Poland Max Planck Inst Informat Saarbrucken Germany
The achromatic number problem is, given a graph G = (V, E), to find the greatest number of colors, Psi(G), in a coloring of the vertices of G such that adjacent vertices get distinct colors and for every pair of color... 详细信息
来源: 评论
Fixed-Parameter and approximation algorithms for Maximum Agreement Forests of Multifurcating Trees
收藏 引用
ALGORITHMICA 2016年 第3期74卷 1019-1054页
作者: Whidden, Chris Beiko, Robert G. Zeh, Norbert Fred Hutchinson Canc Res Ctr Program Computat Biol 1124 Columbia St Seattle WA 98104 USA Dalhousie Univ Fac Comp Sci Halifax NS Canada
We present efficient fixed-parameter and approximation algorithms for the NP-hard problem of computing a maximum agreement forest (MAF) of a pair of multifurcating (nonbinary) rooted trees. Multifurcating trees arise ... 详细信息
来源: 评论
A case study of de-randomization methods for combinatorial approximation algorithms
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 1998年 第3期2卷 219-236页
作者: Rolim, JDP Trevisan, L Univ Geneva Ctr Univ Informat CH-1204 Geneva Switzerland MIT Comp Sci Lab Cambridge MA 02139 USA
We study three different de-randomization methods that are often applied to approximate combinatorial optimization problems. We analyze the conditional probabilities method in connection with randomized rounding for r... 详细信息
来源: 评论
Simpler and Better approximation algorithms for the Unweighted Minimum Label s-t Cut Problem
收藏 引用
ALGORITHMICA 2018年 第1期80卷 398-409页
作者: Zhang, Peng Fu, Bin Tang, Linqing Shandong Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China Univ Texas Pan Amer Dept Comp Sci Edinburg TX 78539 USA Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100190 Peoples R China
Given a graph with a label set , in which each edge has a label from L, and a source together with a sink , the Minimum Label s-t Cut problem asks to pick a set of labels with minimized cardinality, such that the remo... 详细信息
来源: 评论