咨询与建议

限定检索结果

文献类型

  • 129 篇 会议
  • 14 篇 期刊文献
  • 3 册 图书

馆藏范围

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

日期分布

学科分类号

  • 87 篇 工学
    • 81 篇 计算机科学与技术...
    • 20 篇 软件工程
    • 5 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 电气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 化学工程与技术
  • 80 篇 理学
    • 80 篇 数学
    • 8 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 1 篇 化学
    • 1 篇 系统科学
  • 5 篇 管理学
    • 4 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 3 篇 经济学
    • 3 篇 应用经济学

主题

  • 13 篇 algorithms
  • 6 篇 approximation al...
  • 6 篇 polynomial appro...
  • 5 篇 discrete fourier...
  • 4 篇 computational ge...
  • 3 篇 set theory
  • 3 篇 graphic methods
  • 3 篇 logarithm (log)
  • 3 篇 logs
  • 2 篇 computer science
  • 2 篇 generating funct...
  • 2 篇 lattices
  • 2 篇 computational co...
  • 2 篇 shortest vector ...
  • 2 篇 trees (mathemati...
  • 2 篇 average-case ana...
  • 2 篇 planted clique
  • 2 篇 mixtures
  • 2 篇 optimization pro...
  • 2 篇 discrete fourier...

机构

  • 6 篇 rhein westfal th...
  • 3 篇 university of wi...
  • 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 篇 labri université...
  • 2 篇 max planck inst ...
  • 2 篇 inst for basic s...
  • 2 篇 univ warwick ctr...
  • 2 篇 technion israel ...
  • 2 篇 cornell univ 107...
  • 2 篇 univ montpellier...
  • 2 篇 harvard john a p...
  • 2 篇 ut austin austin...

作者

  • 9 篇 csaba d. tóth
  • 5 篇 adrian dumitresc...
  • 3 篇 englert matthias
  • 3 篇 agarwal pankaj k...
  • 3 篇 servedio rocco a...
  • 3 篇 tóth csaba d.
  • 3 篇 grohe martin
  • 2 篇 chan siu-on
  • 2 篇 de anindya
  • 2 篇 stephens-davidow...
  • 2 篇 kapralov michael
  • 2 篇 roughgarden tim
  • 2 篇 michael kaufmann
  • 2 篇 raghavendra pras...
  • 2 篇 sharir micha
  • 2 篇 wiederrecht seba...
  • 2 篇 traub vera
  • 2 篇 vöcking b
  • 2 篇 diakonikolas ili...
  • 2 篇 koch laura varga...

语言

  • 145 篇 英文
  • 1 篇 其他
检索条件"任意字段=13th Annual ACM/SIAM Symposium on Discrete Algorithms"
146 条 记 录,以下是1-10 订阅
排序:
35th annual acm-siam symposium on discrete algorithms, SODA 2024
35th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ...
收藏 引用
35th annual acm-siam symposium on discrete algorithms, SODA 2024
the proceedings contain 192 papers. the topics discussed include: prior-independent auctions for heterogeneous bidders;impossibilities for obviously strategy-proof mechanisms;revenue maximization for buyers with costl...
来源: 评论
34th annual acm-siam symposium on discrete algorithms, SODA 2023
34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ...
收藏 引用
34th annual acm-siam symposium on discrete algorithms, SODA 2023
the proceedings contain 189 papers. the topics discussed include: dynamic algorithms for packing-covering LPs via multiplicative weight updates;maintaining expander decompositions via sparse cuts;fully dynamic exact e...
来源: 评论
Single-Source Unsplittable Flows in Planar Graphs  35
Single-Source Unsplittable Flows in Planar Graphs
收藏 引用
35th annual acm-siam symposium on discrete algorithms (SODA)
作者: Traub, Vera Koch, Laura Vargas Zenklusen, Rico Univ Bonn Res Inst Discrete Math Bonn Germany Univ Bonn Hausdorff Ctr Math Bonn Germany Swiss Fed Inst Technol Dept Math Zurich Switzerland
the single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single path. One of the most heavily studie...
来源: 评论
Kernelization for Graph Packing Problems via Rainbow Matching  34
Kernelization for Graph Packing Problems via Rainbow Matchin...
收藏 引用
34th acm-siam annual symposium on discrete algorithms (SODA)
作者: Bessy, Stephane Bougeret, Marin thilikos, Dimitrios M. Wiederrecht, Sebastian Univ Montpellier CNRS LIRMM Montpellier France Inst for Basic Sci Korea Discrete Math Grp Daejeon South Korea
We introduce a new kernelization tool, called rainbow matching technique, that is appropriate for the design of polynomial kernels for packing problems. Our technique capitalizes on the powerful combinatorial results ... 详细信息
来源: 评论
Fast and Accurate Approximations of the Optimal Transport in Semi-discrete and discrete Settings  35
Fast and Accurate Approximations of the Optimal Transport in...
收藏 引用
35th annual acm-siam symposium on discrete algorithms (SODA)
作者: Agarwal, Pankaj K. Raghvendra, Sharath Shirzadian, Pouyan Yao, Keegan Duke Univ Dept Comp Sci Durham NC 27706 USA North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA Virginia Tech Dept Comp Sci Blacksburg VA USA
Given a d-dimensional continuous (resp. discrete) probability distribution mu and a discrete distribution nu, the semi-discrete (resp. discrete) optimal transport (OT) problem asks for computing a minimum-cost plan to...
来源: 评论
Packing cycles in planar and bounded-genus graphs  34
Packing cycles in planar and bounded-genus graphs
收藏 引用
34th acm-siam annual symposium on discrete algorithms (SODA)
作者: Schlomberg, Niklas thiele, Hanjo Vygen, Jens Univ Bonn Res Inst Discrete Math Bonn Germany Univ Bonn Hausdorff Ctr Math Bonn Germany Greenplan GmbH Bonn Germany Swiss Fed Inst Technol FIM Zurich Switzerland
We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here disjoint can mean vertex-disjoint or ed... 详细信息
来源: 评论
Weisfeiler-Leman and Graph Spectra  34
Weisfeiler-Leman and Graph Spectra
收藏 引用
34th acm-siam annual symposium on discrete algorithms (SODA)
作者: Rattan, Gaurav Seppelt, Tim Rhein Westfal TH Aachen Aachen Germany
Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family of graphs which is provably weaker t... 详细信息
来源: 评论
Excluding Single-Crossing Matching Minors in Bipartite Graphs  34
Excluding Single-Crossing Matching Minors in Bipartite Graph...
收藏 引用
34th acm-siam annual symposium on discrete algorithms (SODA)
作者: Giannopoulou, Archontia C. thilikos, Dimitrios M. Wiederrecht, Sebastian Natl & Kapodistrian Univ Athens Dept Informat & Telecommun Athens Greece Univ Montpellier CNRS LIRMM Montpellier France Inst for Basic Sci Korea Discrete Math Grp Daejeon South Korea
By a seminal result of Valiant, computing the permanent of (0, 1)-matrices is, in general, #P-hard. In 1913 P ' olya asked for which (0, 1)-matrices A it is possible to change some signs such that the permanent of... 详细信息
来源: 评论
IMPROVED CLASSICAL AND QUANTUM algorithms FOR thE SHORTEST VECTOR PROBLEM VIA BOUNDED DISTANCE DECODING
收藏 引用
siam JOURNAL ON COMPUTING 2025年 第2期54卷 233-278页
作者: Aggarwal, Divesh Chen, Yanlin Kumar, Rajendra Shen, Yixin Ctr Quantum Technol Singapore 117543 Singapore Natl Univ Singapore Singapore 117543 Singapore QuSoft Amsterdam Netherlands CWI Amsterdam Netherlands Indian Inst Technol Delhi New Delhi 110016 India Univ Rennes Inria CNRS IRISA F-35040 Rennes France
the most important computational problem on lattices is the shortest vector problem (SVP). In this paper, we present new algorithms that improve the state-of-the-art for provable classical/quantum algorithms for SVP. ... 详细信息
来源: 评论
Approximate Evaluation of First-Order Counting Queries  32
Approximate Evaluation of First-Order Counting Queries
收藏 引用
32nd annual acm-siam symposium on discrete algorithms (SODA)
作者: Dreier, Jan Rossmanith, Peter Rhein Westfal TH Aachen Aachen Germany
Kuske and Schweikardt introduced the very expressive first-order counting logic FOC(P) to model database queries with counting operations. they showed that there is an efficient model-checking algorithm on graphs with... 详细信息
来源: 评论