咨询与建议

限定检索结果

文献类型

  • 12 篇 期刊文献
  • 2 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 11 篇 工学
    • 11 篇 计算机科学与技术...
  • 5 篇 理学
    • 5 篇 数学
  • 1 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 14 篇 exponential-time...
  • 3 篇 graph algorithms
  • 2 篇 sort & search
  • 2 篇 phylogenetics
  • 2 篇 combinatorics
  • 2 篇 approximation al...
  • 2 篇 scheduling
  • 2 篇 agreement forest...
  • 1 篇 tournaments
  • 1 篇 exact algorithms
  • 1 篇 graph classes
  • 1 篇 kernelization
  • 1 篇 feedback vertex ...
  • 1 篇 algorithms
  • 1 篇 boolean connecti...
  • 1 篇 art gallery
  • 1 篇 bipartite graphs
  • 1 篇 dominating set
  • 1 篇 terrain guarding
  • 1 篇 3-sat

机构

  • 1 篇 kyoto univ sakyo...
  • 1 篇 crestic ifts pol...
  • 1 篇 maastricht univ ...
  • 1 篇 univ warsaw inst...
  • 1 篇 univ tours lab i...
  • 1 篇 eindhoven univ t...
  • 1 篇 kyoto univ grad ...
  • 1 篇 uppsala univ dep...
  • 1 篇 linkoping univ d...
  • 1 篇 inst math sci ch...
  • 1 篇 ben gurion univ ...
  • 1 篇 indian inst tech...
  • 1 篇 kwansei gakuin u...
  • 1 篇 inst math sci 4t...
  • 1 篇 maastricht univ ...
  • 1 篇 ben gurion univ ...
  • 1 篇 univ orleans lab...
  • 1 篇 univ bergen berg...
  • 1 篇 univ tokyo grad ...
  • 1 篇 eindhoven univ t...

作者

  • 2 篇 tamaki suguru
  • 2 篇 liedloff mathieu
  • 2 篇 saurabh saket
  • 1 篇 t'kindt v.
  • 1 篇 jonsson p
  • 1 篇 ashok pradeesha
  • 1 篇 teutrine e.
  • 1 篇 mnich m.
  • 1 篇 kolay sudeshna
  • 1 篇 soukhal a.
  • 1 篇 letourneur romai...
  • 1 篇 meuwese r.
  • 1 篇 wahström m
  • 1 篇 seto kazuhisa
  • 1 篇 liedloff m.
  • 1 篇 iwama kazuo
  • 1 篇 kelk s.
  • 1 篇 jansen bart m. p...
  • 1 篇 shang lei
  • 1 篇 ramanujan m. s.

语言

  • 14 篇 英文
检索条件"主题词=exponential-time algorithms"
14 条 记 录,以下是1-10 订阅
Agreement forests of caterpillar trees: Complexity, kernelization and branching *
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 1003卷
作者: Kelk, S. Meuwese, R. Maastricht Univ Dept Adv Comp Sci DACS Maastricht Netherlands
Given a set X of species, a phylogenetic tree is an unrooted binary tree whose leaves are bijectively labelled by X. Such trees can be used to show the way species evolve over time. One way of understanding how topolo... 详细信息
来源: 评论
CONVEX CHARACTERS, algorithms, AND MATCHINGS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2024年 第1期38卷 380-411页
作者: Kelk, Steven Meuwese, Ruben Wagner, Stephan Maastricht Univ Dept Adv Comp Sci DACS NL-6200 Maastricht Netherlands Uppsala Univ Dept Math Uppsala Sweden
Phylogenetic trees are used to model evolution: leaves are labeled to represent contemporary species (``taxa""), and interior vertices represent extinct ancestors. Informally, convex characters are measureme... 详细信息
来源: 评论
Optimal Polynomial-time Compression for Boolean Max CSP
收藏 引用
ACM TRANSACTIONS ON COMPUTATION THEORY 2024年 第1期16卷 1-20页
作者: Jansen, Bart M. P. Wlodarczyk, Michal Eindhoven Univ Technol POB 513 NL-5600 MB Eindhoven MB Netherlands
In the Boolean maximum constraint satisfaction problem-Max CSP(G)-one is given a collection of weighted applications of constraints from a finite constraint language Gamma, over a common set of variables, and the goal... 详细信息
来源: 评论
exponential-time Approximation Schemes via Compression  15
Exponential-Time Approximation Schemes via Compression
收藏 引用
15th Innovations in Theoretical Computer Science Conference (ITCS)
作者: Inamdar, Tanmay Kundu, Madhumita Parviainen, Pekka Ramanujan, M. S. Saurabh, Saket Indian Inst Technol Jodhpur Rajasthan India Univ Bergen Bergen Norway Univ Warwick Coventry W Midlands England Inst Math Sci Chennai Tamil Nadu India
In this paper, we give a framework to design exponential-time approximation schemes for basic graph partitioning problems such as k-WAY CUT, MULTIWAY CUT, STEINER k-CUT and MULTICUT, where the goal is to minimize the ... 详细信息
来源: 评论
A Sort & Search method for multicriteria optimization problems with applications to scheduling theory
收藏 引用
JOURNAL OF MULTI-CRITERIA DECISION ANALYSIS 2019年 第1-2期26卷 84-90页
作者: Shang, Lei T'Kindt, Vincent Univ Tours LIFAT EA 6300 ERL ROOT CNRS 7002 64 Ave Jean Portalis F-37200 Tours France
This paper focuses on the Sort & Search method to solve a particular class of single criterion optimization problems called multiple constraints problems. This general method enables to derive exponential-time alg... 详细信息
来源: 评论
Exact algorithms for Terrain Guarding
收藏 引用
ACM TRANSACTIONS ON algorithms 2018年 第2期14卷 1–20页
作者: Ashok, Pradeesha Fomin, Fedor, V Kolay, Sudeshna Saurabh, Saket Zehavi, Meirav Int Inst Informat Technol Bangalore 26-CHosur RdElect City Phase 1 Bengaluru 560100 Karnataka India Univ Bergen Dept Informat Thormohlensgate 55 N-5008 Bergen Norway Eindhoven Univ Technol NL-5612 AZ Eindhoven Netherlands Inst Math Sci 4th Cross StCIT Campus Madras 600113 Tamil Nadu India Ben Gurion Univ Negev Beer Sheva Israel Ben Gurion Univ Negev Comp Sci Dept Alon High Tech Bldg Beer Sheva Israel
Given a 1.5-dimensional terrain T, also known as an x-monotone polygonal chain, the Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the points on T. Here, we say that a point p g... 详细信息
来源: 评论
Improved bounds for minimal feedback vertex sets in tournaments
收藏 引用
JOURNAL OF GRAPH THEORY 2018年 第3期88卷 482-506页
作者: Mnich, M. Teutrine, E. Univ Bonn Inst Informat Bonn Germany Maastricht Univ Dept Quantitat Econ Maastricht Netherlands
We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs. As our main result, we show that any tournament on n nodes has at most 1.5949(n) minimal FVS. This significantly improves ... 详细信息
来源: 评论
On the number of minimal dominating sets on some graph classes
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第C期562卷 634-642页
作者: Couturier, Jean-Francois Letourneur, Romain Liedloff, Mathieu CReSTIC IFTS Pole Haute Technol F-08000 Charleville Mezieres France Univ Orleans INSA Ctr Val Loire LIFO EA 4022 FR-45067 Orleans France
A dominating set in a graph is a subset of vertices such that each vertex is either in the dominating set or adjacent to some vertex in the dominating set. It is known that graphs have at most O(1.7159(n)) minimal dom... 详细信息
来源: 评论
On an extension of the Sort & Search method with application to scheduling theory
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 511卷 13-22页
作者: Lente, Ch Liedloff, M. Soukhal, A. T'Kindt, V. Univ Tours Lab Informat Equipe Ordonnancement & Conduite CNRSERL 6305EA 6300 F-37200 Tours France Univ Orleans Lab Informat Fondamentale Orleans F-45067 Orleans 2 France
In this paper, we focus on the Sort & Search method initially proposed by Horowitz and Sahni (1974) [6] to solve the knapsack problem, which has already show its applicability to derive exponential-time algorithms... 详细信息
来源: 评论
An exact algorithm for the Boolean connectivity problem for k-CNF
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第35期412卷 4613-4618页
作者: Makino, Kazuhisa Tamaki, Suguru Yamamoto, Masaki Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan Univ Tokyo Grad Sch Informat Sci & Technol Tokyo 1138654 Japan Kwansei Gakuin Univ Dept Informat Nishinomiya Hyogo Japan
We present an exact algorithm for a PSPACE-complete problem, denoted by CONNkSAT, which asks whether the solution space for a given k-CNF formula is connected on the n-dimensional hypercube. The problem is known to be... 详细信息
来源: 评论