Introduction-Reference-Cited by-同舟云学术

Introduction

Published:2010 Issue: Volume: Page:1-11
ISSN:1862-4499
Container-title:Exact Exponential Algorithms
language:
Short-container-title:

Author:

Fomin Fedor V.,Kratsch Dieter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-16533-7_1.pdf

Reference29 articles.

1. Bellman, R.: Combinatorial processes and dynamic programming. In: Proc. Sympos. Appl. Math., Vol. 10, pp. 217–249. American Mathematical Society, Providence, R.I. (1960)

2. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9, 61–63 (1962)

3. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM 10, 196–210 (1962)

4. Miller, R.E., Muller, D.E.: A problem of maximum consistent subsets. IBM Research Rep. RC-240, J.T. Watson Research Center, Yorktown Heights, New York, USA (1960)

5. Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23–28 (1965)

Cited by 232 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding small feedback arc sets on large graphs;Computers & Operations Research;2024-09

2. Improved kernelization and fixed-parameter algorithms for bicluster editing;Journal of Combinatorial Optimization;2024-07

3. On Graphs Coverable by \({k}\) Shortest Paths;SIAM Journal on Discrete Mathematics;2024-06-10

4. The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Computational complexity of normalizing constants for the product of determinantal point processes;Theoretical Computer Science;2024-05