Block Sorting Is APX-Hard (Q2947036)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Block Sorting Is APX-Hard	scientific article

Statements

scholarly article

0 references

Block Sorting Is APX-Hard (English)

0 references

N. S. Narayanaswamy

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

21 September 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-18173-8_28

0 references

Sorting by Transpositions

0 references

A quadratic time 2-approximation algorithm for block sorting

0 references

Block Sorting is Hard

0 references

Sorting by Transpositions Is Difficult

0 references

Some optimal inapproximability results

0 references

FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

0 references

0 references

Computing and Combinatorics

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-18173-8_28

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2947036

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2947036&oldid=36201597"