咨询与建议

限定检索结果

文献类型

  • 18 篇 期刊文献
  • 7 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 22 篇 工学
    • 21 篇 计算机科学与技术...
    • 6 篇 软件工程
    • 1 篇 电气工程
  • 11 篇 理学
    • 11 篇 数学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 25 篇 exponential time...
  • 6 篇 exact algorithms
  • 5 篇 graph algorithms
  • 5 篇 measure and conq...
  • 3 篇 approximation al...
  • 2 篇 traveling salesm...
  • 2 篇 space-efficient ...
  • 2 篇 edge dominating ...
  • 2 篇 dominating set
  • 2 篇 dominating cliqu...
  • 2 篇 minimum maximal ...
  • 2 篇 graph coloring
  • 1 篇 graphs
  • 1 篇 minimum independ...
  • 1 篇 branch and bound
  • 1 篇 branching algori...
  • 1 篇 sparsification l...
  • 1 篇 induced cluster
  • 1 篇 fixed parameter ...
  • 1 篇 maximum satisfia...

机构

  • 2 篇 univ utrecht ins...
  • 2 篇 univ paul verlai...
  • 2 篇 inst univ france
  • 2 篇 univ orleans lab...
  • 2 篇 eindhoven univ t...
  • 2 篇 univ bergen dept...
  • 2 篇 univ utrecht dep...
  • 2 篇 inst math sci ma...
  • 1 篇 russian acad sci...
  • 1 篇 penn state univ ...
  • 1 篇 natl univ singap...
  • 1 篇 univ wisconsin m...
  • 1 篇 univ paul verlai...
  • 1 篇 mit comp sci & a...
  • 1 篇 natl univ singap...
  • 1 篇 nyu ny 10003 usa
  • 1 篇 unsw australia n...
  • 1 篇 utrecht universi...
  • 1 篇 psl res univ uni...
  • 1 篇 univ paris 09 f-...

作者

  • 4 篇 kratsch dieter
  • 4 篇 bodlaender hans ...
  • 4 篇 liedloff mathieu
  • 4 篇 nederlof jesper
  • 4 篇 gaspers serge
  • 3 篇 van rooij johan ...
  • 3 篇 saurabh saket
  • 3 篇 fomin fedor v.
  • 2 篇 escoffier bruno
  • 2 篇 bansal nikhil
  • 2 篇 stephan frank
  • 2 篇 paschos vangelis...
  • 2 篇 hoi gordon
  • 2 篇 lokshtanov danie...
  • 1 篇 okamoto yoshio
  • 1 篇 subramanian c. r...
  • 1 篇 golovnev alexand...
  • 1 篇 della croce fede...
  • 1 篇 vyas nikhil
  • 1 篇 wahlstroem magnu...

语言

  • 23 篇 英文
  • 2 篇 其他
检索条件"主题词=Exponential Time Algorithms"
25 条 记 录,以下是1-10 订阅
排序:
exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2020年 第3期39卷 764-775页
作者: T'kindt, Vincent Shang, Lei Della Croce, Federico Univ Tours CNRS 7002 Lab Fundamental & Appl Comp Sci ERLEA 6300 64 Ave Jean Portalis F-37200 Tours France Politecn Torino DIGEP Corso Duca Abruzzi 24 I-10129 Turin Italy CNR IEIIT Turin Italy
This paper focuses on the solution, by exact exponential-time algorithms, of just-in-time scheduling problems when jobs have symmetric earliness/tardiness weights and share a non restrictive common due date. For the s... 详细信息
来源: 评论
Faster Graph Coloring in Polynomial Space
收藏 引用
ALGORITHMICA 2023年 第2期85卷 584-609页
作者: Gaspers, Serge Lee, Edward J. UNSW Sydney Sydney NSW Australia
We present a polynomial-space algorithm that computes the number of independent sets of any input graph in time O(1.1389(n)) for graphs with maximum degree 3 and in time O(1.2356(n)) for general graphs, where n is the... 详细信息
来源: 评论
A Bisection Approach to Subcubic Maximum Induced Matching  1
收藏 引用
18th International Conference and Workshops on algorithms and Computation (WALCOM)
作者: Hoi, Gordon Jain, Sanjay Sabili, Ammar Fathin Stephan, Frank Temasek Polytech Sch Informat & IT 21 Tampines Ave 1 Singapore 529757 Singapore Natl Univ Singapore Sch Comp 13 Comp Dr Singapore 117417 Singapore Natl Univ Singapore Dept Math 10 Lower Kent Ridge Rd Singapore 119076 Singapore
In this paper, we present a faster exact algorithm which solves the Maximum Induced Matching problem for subcubic graphs. Here let n be the overall number of vertices and k be the number of those vertices of degree 3 ... 详细信息
来源: 评论
Improved algorithms for the general exact satisfiability problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 889卷 60-84页
作者: Hoi, Gordon Stephan, Frank Natl Univ Singapore Sch Comp 13 Comp DrBlock COM1 Singapore 117417 Singapore Natl Univ Singapore Dept Math 10 Lower Kent Ridge RdBlock S17 Singapore 119076 Singapore Natl Univ Singapore Sch Comp 10 Lower Kent Ridge RdBlock S17 Singapore 119076 Singapore
The Exact Satisfiability problem asks if we can find a satisfying assignment to each clause such that exactly one literal in each clause is assigned 1, while the rest are all assigned 0. We can generalise this problem... 详细信息
来源: 评论
New Tools and Connections for exponential-time Approximation
收藏 引用
ALGORITHMICA 2019年 第10期81卷 3993-4009页
作者: Bansal, Nikhil Chalermsook, Parinya Laekhanukit, Bundit Nanongkai, Danupon Nederlof, Jesper Eindhoven Univ Technol Eindhoven Netherlands Aalto Univ Helsinki Finland Shanghai Univ Finance & Econ Shanghai Peoples R China Royal Inst Technol KTH Stockholm Sweden
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and an integer r > 1, and the goal is to design an approximation algorithm wi... 详细信息
来源: 评论
Bipartite TSP in O(1.9999n) time, Assuming Quadratic time Matrix Multiplication  52
Bipartite TSP in O(1.9999<SUP>n</SUP>) Time, Assuming Quadra...
收藏 引用
52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Nederlof, Jesper Univ Utrecht Utrecht Netherlands Eindhoven Univ Technol Eindhoven Netherlands
The symmetric traveling salesman problem (TSP) is the problem of finding the shortest Hamiltonian cycle in an edge-weighted undirected graph. In 1962 Bellman, and independently Held and Karp, showed that TSP instances... 详细信息
来源: 评论
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication  2020
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time m...
收藏 引用
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
作者: Jesper Nederlof Utrecht University Netherlands
The symmetric traveling salesman problem (TSP) is the problem of finding the shortest Hamiltonian cycle in an edge-weighted undirected graph. In 1962 Bellman, and independently Held and Karp, showed that TSP instances... 详细信息
来源: 评论
Gate elimination: Circuit size lower bounds and #SAT upper bounds
收藏 引用
THEORETICAL COMPUTER SCIENCE 2018年 719卷 46-63页
作者: Golovnev, Alexander Kulikov, Alexander S. Smal, Alexander V. Tamaki, Suguru NYU New York NY 10003 USA Russian Acad Sci Steklov Inst Math St Petersburg Dept St Petersburg Russia Kyoto Univ Kyoto Japan
Most of the known lower bounds for binary Boolean circuits with unrestricted depth are proved by the gate elimination method. The most efficient known algorithms for the #SAT problem on binary Boolean circuits use sim... 详细信息
来源: 评论
FASTER SPACE-EFFICIENT algorithms FOR SUBSET SUM, k-SUM, AND RELATED PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 2018年 第5期47卷 1755-1777页
作者: Bansal, Nikhil Garg, Shashwat Nederlof, Jesper Vyas, Nikhil Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 AB Eindhoven Netherlands MIT Comp Sci & Artificial Intelligence Lab 77 Massachusetts Ave Cambridge MA 02139 USA
We present randomized algorithms that solve subset sum and knapsack instances with n items in O*((20.86n)) time, where the O* (.) notation suppresses factors polynomial in the input size, and polynomial space, assumin... 详细信息
来源: 评论
Simple Paths and Cycles Avoiding Forbidden Paths  44th
Simple Paths and Cycles Avoiding Forbidden Paths
收藏 引用
44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)
作者: Momege, Benjamin Inria Lille Nord Europe Villeneuve Dascq France
A graph with forbidden paths is a pair (G, F) where G is a graph and F is a subset of the set of paths in G. A simple path avoiding forbidden paths in (G, F) is a simple path in G such that each subpath is not in F. I... 详细信息
来源: 评论