Amanote Research
Register
Sign In
On Reoptimization of the Shortest Common Superstring Problem
Applied Mathematical Sciences
doi 10.12988/ams.2013.13109
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2013
Authors
V. Popov
Publisher
Hikari, Ltd.
Related search
Conditional Inequalities and the Shortest Common Superstring Problem
International Journal of Foundations of Computer Science
Computer Science
Approximation Algorithms for the Shortest Superstring Problem.
The Steiner Tree Reoptimization Problem With Sharpened Triangle Inequality
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Problem With the Superstring Action of Deriglazov and Galajinsky
Physical Review D
Fuzzy Shortest Path Problem Based on Index Ranking
Journal of Mathematics Research
Letter to the Editor—A Variant on the Shortest-Route Problem
Operations Research
Management Science
Computer Science Applications
Operations Research
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
The Shortest Path Problem for a Multiple Graph
Modeling and Analysis of Information Systems
The Minimum Equivalent DNF Problem and Shortest Implicants
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
