咨询与建议

限定检索结果

文献类型

  • 225 篇 会议
  • 19 篇 期刊文献
  • 3 册 图书

馆藏范围

  • 246 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 175 篇 工学
    • 153 篇 计算机科学与技术...
    • 55 篇 软件工程
    • 11 篇 电气工程
    • 9 篇 信息与通信工程
    • 4 篇 材料科学与工程(可...
    • 4 篇 测绘科学与技术
    • 3 篇 光学工程
    • 3 篇 农业工程
    • 3 篇 生物工程
    • 2 篇 机械工程
    • 2 篇 冶金工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 控制科学与工程
    • 2 篇 土木工程
  • 119 篇 理学
    • 112 篇 数学
    • 6 篇 物理学
    • 6 篇 统计学(可授理学、...
    • 4 篇 生物学
    • 2 篇 地球物理学
    • 1 篇 化学
    • 1 篇 地理学
    • 1 篇 系统科学
  • 37 篇 管理学
    • 27 篇 管理科学与工程(可...
    • 17 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 11 篇 经济学
    • 6 篇 理论经济学
    • 5 篇 应用经济学
  • 6 篇 医学
    • 5 篇 临床医学
  • 3 篇 农学
    • 3 篇 作物学
  • 1 篇 法学
    • 1 篇 社会学

主题

  • 97 篇 approximation al...
  • 14 篇 online algorithm...
  • 12 篇 approximation al...
  • 10 篇 competitive anal...
  • 10 篇 polynomial appro...
  • 8 篇 vectors
  • 6 篇 combinatorial op...
  • 5 篇 traveling salesm...
  • 5 篇 approximation
  • 5 篇 algorithm design...
  • 5 篇 social networkin...
  • 4 篇 computational co...
  • 4 篇 convergence
  • 4 篇 dynamic programm...
  • 4 篇 mathematical mod...
  • 3 篇 conferences
  • 3 篇 image segmentati...
  • 3 篇 online algorithm
  • 3 篇 analysis of algo...
  • 3 篇 bandwidth

机构

  • 3 篇 sobolev inst mat...
  • 2 篇 univ alberta dep...
  • 2 篇 univ technol kos...
  • 2 篇 ctr math & comp ...
  • 2 篇 cwi
  • 2 篇 athens univ econ...
  • 2 篇 univ calif river...
  • 2 篇 tech univ carolo...
  • 2 篇 sobolev institut...
  • 2 篇 institut univers...
  • 2 篇 eindhoven univ t...
  • 2 篇 univ haifa dept ...
  • 2 篇 national geomati...
  • 2 篇 technion israel ...
  • 2 篇 univ hong kong p...
  • 2 篇 tech univ berlin...
  • 2 篇 ahlia univ coll ...
  • 2 篇 king fahd univ p...
  • 2 篇 natl ict austral...
  • 2 篇 tech univ kosice...

作者

  • 7 篇 jansen klaus
  • 4 篇 levin asaf
  • 4 篇 stougie leen
  • 3 篇 bar-noy amotz
  • 3 篇 woeginger gerhar...
  • 3 篇 bonifaci vincenz...
  • 3 篇 hochbaum dorit s...
  • 3 篇 ageev alexander ...
  • 3 篇 berman p
  • 3 篇 nutov zeev
  • 3 篇 epstein leah
  • 2 篇 heinz stefan
  • 2 篇 chan timothy m.
  • 2 篇 kortsarz guy
  • 2 篇 jun zhang
  • 2 篇 kamil h
  • 2 篇 awad wasan s.
  • 2 篇 van stee rob
  • 2 篇 joão v.f. neto
  • 2 篇 fukunaga takuro

语言

  • 244 篇 英文
  • 2 篇 其他
  • 1 篇 中文
检索条件"任意字段=4th International Workshop on Approximation and Online Algorithms"
247 条 记 录,以下是1-10 订阅
排序:
approximation and online algorithms: 4th international workshop, WAOA 2006 Revised Papers
Approximation and Online Algorithms: 4th International Works...
收藏 引用
4th workshop on approximation and online algorithms, WAOA 2006
the proceedings contain 26 papers. the topics discussed include: approximation algorithms for scheduling problems with exact delays;coping with interference: from maximum coverage to planning cellular networks;online ... 详细信息
来源: 评论
approximation and online algorithms - 10th international workshop, WAOA 2012, Revised Selected Papers
Approximation and Online Algorithms - 10th International Wor...
收藏 引用
10th international workshop on approximation and online algorithms, WAOA 2012
the proceedings contain 22 papers. the topics discussed include: independent set with advice: the impact of graph knowledge;online multi-commodity flow with high demands;on the complexity of the regenerator location p...
来源: 评论
19th international workshop on approximation and online algorithms, WAOA 2021
19th International Workshop on Approximation and Online Algo...
收藏 引用
19th international workshop on approximation and online algorithms, WAOA 2021
the proceedings contain 16 papers. the special focus in this conference is on approximation and online algorithms. the topics include: FIFO and Randomized Competitive Packet Routing Games;improved online Algorith...
来源: 评论
4th international workshop on approximation algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th international workshop on Randomization and approximation Techniques in Computer Science, RANDOM 2001
收藏 引用
4th international workshop on approximation algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th international workshop on Randomization and approximation Techniques in Computer Science, RANDOM 2001
the proceedings contain 32 papers. the special focus in this conference is on APPROX and RANDOM. the topics include: Using complex semidefinite programming for approximating MAX E2-LIN3;hill-climbing vs. simulated ann...
来源: 评论
approximation, randomization, and combinatorial optimization : algorithms and techniques : 4th Inter
收藏 引用
2001年
作者: international workshop on approximation algorithms for Combinatorial Optimization Problems
来源: 内蒙古大学图书馆图书 评论
approximation and online algorithms  2007
收藏 引用
丛书名: Lecture Notes in Computer Science
2007年
作者: thomas Erlebach Christos Kaklamanis
来源: 评论
On Hierarchical Diameter-Clustering and the Supplier Problem
收藏 引用
thEORY OF COMPUTING SYSTEMS 2009年 第3期45卷 497-511页
作者: Das, Aparna Kenyon-Mathieu, Claire Brown Univ Providence RI 02918 USA
Given a data set in a metric space, we study the problem of hierarchical clustering to minimize the maximum cluster diameter, and the hierarchical k-supplier problem with customers arriving online. We prove that two p... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
A Randomized Algorithm for online Unit Clustering
收藏 引用
thEORY OF COMPUTING SYSTEMS 2009年 第3期45卷 486-496页
作者: Chan, Timothy M. Zarrabi-Zadeh, Hamid Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada
In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensiona... 详细信息
来源: 评论
approximation algorithms for Multi-Criteria Traveling Salesman Problems
收藏 引用
ALGORIthMICA 2009年 第1期53卷 69-88页
作者: Manthey, Bodo Ram, L. Shankar Yale Univ Dept Comp Sci New Haven CT 06520 USA ETH Inst Theoret Informat CH-8092 Zurich Switzerland
We analyze approximation algorithms for several variants of the traveling salesman problem with multiple objective functions. First, we consider the symmetric TSP (STSP) with gamma-triangle inequality. For this proble... 详细信息
来源: 评论