142
click to vote
MFCS
15 years 6 months ago
2005 Springer 
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
99
Voted
MFCS
15 years 6 months ago
2005 Springer 
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
111
click to vote
MFCS
15 years 6 months ago
2005 Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
97
Voted
MFCS
15 years 6 months ago
2005 Springer 
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
124
Voted
MFCS
15 years 6 months ago
2005 Springer 
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
|
Theoretical Computer Science