咨询与建议

限定检索结果

文献类型

  • 157 篇 会议
  • 20 篇 期刊文献
  • 1 册 图书

馆藏范围

  • 178 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 112 篇 工学
    • 107 篇 计算机科学与技术...
    • 18 篇 软件工程
    • 5 篇 信息与通信工程
    • 3 篇 电气工程
    • 2 篇 控制科学与工程
    • 2 篇 化学工程与技术
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 农业工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 103 篇 理学
    • 101 篇 数学
    • 9 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 2 篇 化学
    • 2 篇 系统科学
    • 1 篇 生物学
  • 6 篇 管理学
    • 5 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 14 篇 approximation al...
  • 13 篇 algorithms
  • 9 篇 polynomial appro...
  • 4 篇 mobile agents
  • 4 篇 discrete fourier...
  • 3 篇 trees (mathemati...
  • 3 篇 graphic methods
  • 3 篇 logarithm (log)
  • 3 篇 logs
  • 3 篇 discrete mathema...
  • 2 篇 computer science
  • 2 篇 generating funct...
  • 2 篇 fourier analysis
  • 2 篇 byzantine agreem...
  • 2 篇 problem solving
  • 2 篇 average-case ana...
  • 2 篇 planted clique
  • 2 篇 probability dist...
  • 2 篇 lower bound
  • 2 篇 mixtures

机构

  • 6 篇 univ alberta dep...
  • 6 篇 rhein westfal th...
  • 4 篇 univ new mexico ...
  • 3 篇 university of wi...
  • 3 篇 univ quebec outa...
  • 3 篇 univ so calif de...
  • 3 篇 univ bristol dep...
  • 3 篇 univ bonn res in...
  • 2 篇 university of ca...
  • 2 篇 rhein westfal th...
  • 2 篇 university of ed...
  • 2 篇 department of ma...
  • 2 篇 univ bonn hausdo...
  • 2 篇 univ calif berke...
  • 2 篇 rhein westfal th...
  • 2 篇 department of co...
  • 2 篇 bar ilan univ de...
  • 2 篇 univ warwick dep...
  • 2 篇 department of co...
  • 2 篇 max planck inst ...

作者

  • 9 篇 csaba d. tóth
  • 7 篇 salavatipour moh...
  • 5 篇 adrian dumitresc...
  • 5 篇 svitkina zoya
  • 5 篇 pelc andrzej
  • 4 篇 friggstad zachar...
  • 4 篇 sanwalani vishal
  • 4 篇 king valerie
  • 4 篇 saia jared
  • 4 篇 andrzej pelc
  • 3 篇 coja-oghlan amin
  • 3 篇 kempe david
  • 3 篇 diakonikolas ili...
  • 3 篇 o'donnell ryan
  • 3 篇 englert matthias
  • 3 篇 servedio rocco a...
  • 3 篇 clifford raphael
  • 3 篇 tóth csaba d.
  • 3 篇 grohe martin
  • 2 篇 chan siu-on

语言

  • 177 篇 英文
  • 1 篇 其他
检索条件"任意字段=8th Annual ACM/SIAM Symposium on Discrete Algorithms"
178 条 记 录,以下是11-20 订阅
排序:
An 8/13-approximation algorithm for the asymmetric maximum TSP  13
An 8/13-approximation algorithm for the asymmetric maximum T...
收藏 引用
13th annual acm/siam symposium on discrete algorithms
作者: Bläser, M Med Univ Lubeck Inst Theoret Informat D-23560 Lubeck Germany
We present a polynomial time approximation algorithm for the asymmetric maximum traveling salesperson problem that achieves performance ratio 8/13(1 - 1/n). the running time of our algorithm is O(n(3)).
来源: 评论
Approximation algorithms for discrete time-cost tradeoff problem
Approximation algorithms for discrete time-cost tradeoff pro...
收藏 引用
Proceedings of the 1996 8th annual acm-siam symposium on discrete algorithms
作者: Skutella, Martin Technische Universitaet Berlin Berlin Germany
the NP-hard discrete version of the Time-Cost Tradeoff Problem is considered. the first polynomial-time approximation algorithms for the problem are presented. Specifically, the problem of finding an optimal schedule ... 详细信息
来源: 评论
Normalizers and permutational isomorphisms in simply-exponential time  31
Normalizers and permutational isomorphisms in simply-exponen...
收藏 引用
31st annual acm-siam symposium on discrete algorithms (SODA)
作者: Wiebking, Daniel Rhein Westfal TH Aachen Aachen Germany
We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. the result is obtained by exploiting canon... 详细信息
来源: 评论
Analytic Combinatorics-A Calculus of discrete Structures  18
Analytic Combinatorics-A Calculus of Discrete Structures
收藏 引用
18th acm-siam symposium on discrete algorithms
作者: Flajolet, Philippe INRIA Rocquencourt Algorithms Project F-78153 Le Chesnay France
the efficiency of many discrete algorithms crucially depends on quantifying properties of large structured combinatorial configurations. We survey methods of analytic combinatorics that are simply based on the idea of... 详细信息
来源: 评论
Tight Cell-Probe Bounds for Online Hamming Distance Computation
Tight Cell-Probe Bounds for Online Hamming Distance Computat...
收藏 引用
24th annual acm-siam symposium on discrete algorithms (SODA)
作者: Clifford, Raphael Jalsenius, Markus Sach, Benjamin Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England
We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. the task is to output the Hamming distance between a fixed string of length n and the last n symbols of a stream. ... 详细信息
来源: 评论
Loopless Generation of Multiset Permutations using a Constant Number of Variables by Prefix Shifts
Loopless Generation of Multiset Permutations using a Constan...
收藏 引用
20th annual acm-siam symposium on discrete algorithms
作者: Williams, Aaron Univ Victoria Dept Comp Sci Victoria BC V8W 3N4 Canada
this paper answers the following mathematical question: Can multiset permutations be ordered so that each permutation is a prefix shift of the previous permutation? Previously, the answer was known for the permutation...
来源: 评论
Communication Complexity of discrete Fair Division  30
Communication Complexity of Discrete Fair Division
收藏 引用
30th annual acm-siam symposium on discrete algorithms (SODA)
作者: Plaut, Benjamin Roughgarden, Tim Stanford Univ Stanford CA 94305 USA
We initiate the study of the communication complexity of fair division with indivisible goods. We focus on some of the most well-studied fairness notions (envy-freeness, proportionality, and approximations thereof) an... 详细信息
来源: 评论
An Efficient Sparse Regularity Concept
An Efficient Sparse Regularity Concept
收藏 引用
20th annual acm-siam symposium on discrete algorithms
作者: Coja-Oghlan, Amin Cooper, Colin Frieze, Alan Univ Edinburgh Sch Informat Edinburgh EH8 9YL Midlothian Scotland Univ London Kings Coll London Dept Comp Sci London WC2R 2LS England Carnegie Mellon Univ Dept Math Sci Pittsburgh PA 15213 USA
Let A be a 0/1 matrix of size m x n, and let p be the density of A (i.e., the number of ones divided by m . n). We show that A can be approximated in the cut norm within epsilon . mnp by a sum of cut matrices (of rank... 详细信息
来源: 评论
Polycubes with Small Perimeter Defect  29
Polycubes with Small Perimeter Defect
收藏 引用
29th annual acm-siam symposium on discrete algorithms (SODA)
作者: Asinowski, Andrei Barequet, Gill Zheng, Yufei Vienna Univ Technol Inst Discrete Math & Geometry A-1040 Vienna Austria Technion Israel Inst Technol Dept Comp Sci IL-3200003 Haifa Israel
A polycube is a face-connected set of cubical cells on Z(3). To-date, no formulae enumerating polycubes by volume (number of cubes) or perimeter (number of empty cubes neighboring the polycube) are known. We present a... 详细信息
来源: 评论
8/7-Approximation Algorithm for (1,2)-TSP
8/7-Approximation Algorithm for (1,2)-TSP
收藏 引用
17th acm-siam symposium on discrete algorithms
作者: Berman, Piotr Karpinski, Marek Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Univ Bonn Dept Comp Sci Bonn Germany
We design a polynomial time 8/7-approximation algorithm for the Traveling Salesman Problem in which all distances are either one or two. this improves over the best known approximation factor for that problem. As a di... 详细信息
来源: 评论