Maximal Strip Recovery Problem With Gaps: Hardness and Approximation Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-10631-6_72
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Approximation Algorithms and Hardness of Thek-Route Cut Problem

ACM Transactions on Algorithms
Mathematics
2016English

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Outer Approximation Method for the Minimum Maximal Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2007English

Approximation Algorithms for the Shortest Superstring Problem.

English

Improved Approximation Algorithms for Firefighter Problem on Trees

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

Computational Experiments With Some Approximation Algorithms for the Travelling Salesman Problem

Applicationes Mathematicae
1983English

Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Approximation Algorithms Design for Disk Partial Covering Problem

2004English

On Weighted Polynomial Approximation With Gaps

Nagoya Mathematical Journal
Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy