Sciweavers

5624 search results - page 36 / 1125
» On Conditional Covering Problem
Sort
View
118
Voted
STRINGOLOGY
2004
15 years 3 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
ISAAC
2005
Springer
102views Algorithms» more  ISAAC 2005»
15 years 7 months ago
Dense Subgraph Problems with Output-Density Conditions
Akiko Suzuki, Takeshi Tokuyama