咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是621-630 订阅
排序:
EXACT AND approximation algorithms FOR SORTING BY REVERSALS, WITH APPLICATION TO GENOME REARRANGEMENT
收藏 引用
ALGORITHMICA 1995年 第1-2期13卷 180-210页
作者: KECECIOGLU, J SANKOFF, D UNIV MONTREAL CTR RECH MATHMONTREAL H3C 3J7PQCANADA
Motivated by the problem in computational biology of reconstructing the series of chromosome inversions by which one organism evolved from another, we consider the problem of computing the shortest series of reversals... 详细信息
来源: 评论
Models and approximation algorithms for channel assignment in radio networks
收藏 引用
WIRELESS NETWORKS 2001年 第6期7卷 575-584页
作者: Krumke, SO Marathe, MV Ravi, SS Konrad Zuse Zentrum Informat Tech Berlin D-14195 Berlin Germany Los Alamos Natl Lab Los Alamos NM 87545 USA SUNY Albany Dept Comp Sci Albany NY 12222 USA
We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can ... 详细信息
来源: 评论
Scalability of Betweenness approximation algorithms: An Experimental Review
收藏 引用
IEEE ACCESS 2019年 7卷 104057-104071页
作者: Wandelt, Sebastian Shi, Xing Sun, Xiaoqian Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China
Betweenness centrality, which measures the contribution of an individual node to the network's connectivity by counting the number of shortest paths a node appears in, is widely used for the analysis of the comple... 详细信息
来源: 评论
Reference points and approximation algorithms in multicriteria discrete optimization
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第3期260卷 829-840页
作者: Buesing, Christina Goetzmann, Kai-Simon Matuschke, Jannik Stiller, Sebastian Rhein Westfal TH Aachen Lehrstuhl Math 2 Pontdriesch 10-12 D-52062 Aachen Germany TU Berlin Inst Math Str 17 Juni 136 D-10623 Berlin Germany Tech Univ Munich TUM Sch Management Arcisstr 21 D-80333 Munich Germany
Mathematical research on multicriteria optimization problems predominantly revolves around the set of Pareto optimal solutions. In practice, on the other hand, methods that output a single solution are more widespread... 详细信息
来源: 评论
approximation algorithms and mechanism design for minimax approval voting
Approximation algorithms and mechanism design for minimax ap...
收藏 引用
作者: Caragiannis, Ioannis Kalaitzis, Dimitris Markakis, Evangelos RACTI Department of Computer Engineering and Informatics University of Patras Greece Department of Informatics Athens University of Economics and Business Greece
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e.g., committee elections. We are intere... 详细信息
来源: 评论
Running Errands in Time: approximation algorithms for Stochastic Orienteering
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2015年 第1期40卷 56-79页
作者: Gupta, Anupam Krishnaswamy, Ravishankar Nagarajan, Viswanath Ravi, R. Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Princeton Univ Dept Comp Sci Princeton NJ 08540 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA
In the stochastic orienteering problem, we are given a finite metric space, where each node contains a job with some deterministic reward and a random processing time. The processing time distributions are known and i... 详细信息
来源: 评论
Parameterized and approximation algorithms for the Load Coloring Problem
收藏 引用
ALGORITHMICA 2017年 第1期79卷 211-229页
作者: Barbero, F. Gutin, G. Jones, M. Sheng, B. Royal Holloway Univ London Egham TW20 0EX Surrey England
Let c, k be two positive integers. Given a graph , the c-Load Coloring problem asks whether there is a c-coloring such that for every , there are at least k edges with both endvertices colored i. Gutin and Jones (Inf ... 详细信息
来源: 评论
Exact and approximation algorithms for clustering
收藏 引用
ALGORITHMICA 2002年 第2期33卷 201-226页
作者: Agarwal, PK Procopiuc, CM Duke Univ Dept Comp Sci Ctr Geometr Comp Durham NC 27708 USA
In this paper we present an n(O(k1-1/d))-time algorithm for solving the k-center problem in R-d, under L-infinity- and L-2-metrics. The algorithm extends to other metrics, and to the discrete k-center problem. We also... 详细信息
来源: 评论
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
收藏 引用
INFORMATION PROCESSING LETTERS 2007年 第5期103卷 195-202页
作者: Feofiloff, Paulo Fernandes, Cristina G. Ferreira, Carlos E. de Pina, Jose Coelho Univ Sao Paulo Inst Matemat & Estatist Dept Ciencia Computacao BR-05508090 Sao Paulo Brazil
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2 - 1 / (n - 1))-approximation for the Prize-Collecting Steiner Tree Problem that runs in O(n(... 详细信息
来源: 评论
Shortest path with acceleration constraints: complexity and approximation algorithms
收藏 引用
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2022年 第2期83卷 555-592页
作者: Ardizzoni, S. Consolini, L. Laurini, M. Locatelli, M. Univ Parma Dipartimento Ingn & Architettura Parco Area Sci181-A Parma Italy
We introduce a variant of the Shortest Path Problem (SPP), in which we impose additional constraints on the acceleration over the arcs, and call it Bounded Acceleration SPP (BASP). This variant is inspired by an indus... 详细信息
来源: 评论