Approximation Algorithms for the Shortest Superstring Problem.

doi 10.1349/ddlp.1386
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Dartmouth College Library Press

Related search

On Reoptimization of the Shortest Common Superstring Problem

Applied Mathematical Sciences
2013English

Conditional Inequalities and the Shortest Common Superstring Problem

International Journal of Foundations of Computer Science
Computer Science
2005English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

A Tabu Search Approximation for Finding the Shortest Distance Using Traveling Salesman Problem

IOSR Journal of Mathematics
2016English

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Approximation Algorithms for the Multiprocessor Open Shop Scheduling Problem

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1999English

Improved Approximation Algorithms for Firefighter Problem on Trees

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy