咨询与建议

限定检索结果

文献类型

  • 11 篇 期刊文献
  • 5 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 12 篇 工学
    • 12 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 7 篇 理学
    • 7 篇 数学

主题

  • 16 篇 exponential algo...
  • 5 篇 approximation al...
  • 5 篇 randomized algor...
  • 4 篇 boolean satisfia...
  • 2 篇 exact algorithms
  • 2 篇 approximate coun...
  • 1 篇 traveling salesm...
  • 1 篇 combinatorics
  • 1 篇 graph algorithms
  • 1 篇 hardness of appr...
  • 1 篇 pattern matching
  • 1 篇 independent sets
  • 1 篇 distortion
  • 1 篇 bandwidth
  • 1 篇 min coloring pro...
  • 1 篇 dominating set
  • 1 篇 algebraic comple...
  • 1 篇 sub-exponential ...
  • 1 篇 min set cover
  • 1 篇 fixed-parameter ...

机构

  • 3 篇 univ paris 09 f-...
  • 1 篇 univ essex sch c...
  • 1 篇 tsinghua univers...
  • 1 篇 polish acad sci ...
  • 1 篇 lamsade cnrs umr...
  • 1 篇 shanghai jiao to...
  • 1 篇 politecn torino ...
  • 1 篇 inst univ france
  • 1 篇 univ bristol dep...
  • 1 篇 univ torino dipa...
  • 1 篇 tu chemnitz chem...
  • 1 篇 tsinghua univ in...
  • 1 篇 vienna univ tech...
  • 1 篇 vienna univ tech...
  • 1 篇 shanghai jiaoton...
  • 1 篇 univ oxford dept...
  • 1 篇 univ paris 09 ps...
  • 1 篇 shanghai jiao to...
  • 1 篇 univ paris panth...
  • 1 篇 middlesex univ d...

作者

  • 4 篇 scheder dominik
  • 3 篇 paschos vangelis...
  • 2 篇 pilipczuk marcin
  • 2 篇 paschos v. th.
  • 2 篇 escoffier bruno
  • 2 篇 escoffier b.
  • 2 篇 bourgeois n.
  • 2 篇 cygan marek
  • 2 篇 bourgeois nicola...
  • 1 篇 steinberger john
  • 1 篇 john p. steinber...
  • 1 篇 goldberg leslie ...
  • 1 篇 lackner martin
  • 1 篇 pratt kevin
  • 1 篇 wojtaszczyk jaku...
  • 1 篇 dominik scheder
  • 1 篇 thurley marc
  • 1 篇 bruner marie-lou...
  • 1 篇 steinberger john...
  • 1 篇 boria nicolas

语言

  • 13 篇 英文
  • 3 篇 其他
检索条件"主题词=Exponential algorithms"
16 条 记 录,以下是11-20 订阅
排序:
Approximation of MIN COLORING by moderately exponential algorithms
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第16期109卷 950-954页
作者: Bourgeois, Nicolas Escoffier, Bruno Paschos, Vangelis Th. LAMSADE CNRS FRE 3234 Paris France Univ Paris 09 F-75775 Paris 16 France
We study in this note approximation algorithms for the problem of coloring the vertices of a graph with as few colors as possible, with moderately exponential running times (and using either polynomial or exponential ... 详细信息
来源: 评论
exponential approximation schemata for some network design problems
收藏 引用
JOURNAL OF DISCRETE algorithms 2013年 22卷 43-52页
作者: Boria, Nicolas Bourgeois, Nicolas Escoffier, Bruno Paschos, Vangelis Th. Univ Torino Dipartmento Inforrnat Turin Italy Univ Paris Pantheon Sorbonne SAMM Pantheon Sorbonne France Univ Paris 09 PSL Res Univ CNRS UMR 7243 LAMSADE Paris France Inst Univ France Paris France
We study approximation of some well-known network design problems such as the TRAVELING SALESMAN PROBLEM (for both minimization and maximization versions) and the MIN STEINER TREE problem by moderately exponential alg... 详细信息
来源: 评论
Fast algorithms for MIN INDEPENDENT DOMINATING SET
收藏 引用
DISCRETE APPLIED MATHEMATICS 2013年 第4-5期161卷 558-572页
作者: Bourgeois, N. Della Croce, F. Escoffier, B. Paschos, V. Th. CNRS LAMSADE F-75700 Paris France Univ Paris 09 F-75775 Paris 16 France Politecn Torino DAI Turin Italy
We first devise a branching algorithm that computes a minimum independent dominating set with running time O*(1.3351(n)) = O*(2(0.417n)) and polynomial space. This improves upon the best state of the art algorithms fo... 详细信息
来源: 评论
Bandwidth and distortion revisited
收藏 引用
DISCRETE APPLIED MATHEMATICS 2012年 第4-5期160卷 494-504页
作者: Cygan, Marek Pilipczuk, Marcin Univ Warsaw Fac Math Comp Sci & Mech PL-02092 Warsaw Poland
In this paper we merge recent developments on exact algorithms for finding an ordering of vertices of a given graph that minimizes bandwidth (the BANDWIDTH problem) and for finding an embedding of a given graph into a... 详细信息
来源: 评论
An Approximation Algorithm for #k-SAT
An Approximation Algorithm for #<i>k</i>-SAT
收藏 引用
29th International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Thurley, Marc Ctr Recerca Matemat Bellaterra Spain
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximat... 详细信息
来源: 评论
Capacitated domination faster than O(2n)
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第23-24期111卷 1099-1103页
作者: Cygan, Marek Pilipczuk, Marcin Wojtaszczyk, Jakub Onufry Polish Acad Sci Inst Math PL-00901 Warsaw Poland Univ Warsaw Dept Math Comp Sci & Mech PL-00325 Warsaw Poland
In this paper we consider the CAPACITATED DOMINATING SET problem a generalisation of the DOMINATING SET problem where each vertex v is additionally equipped with a number c(v), which is the number of other vertices th... 详细信息
来源: 评论