Sciweavers

3228 search results - page 407 / 646
» Computationally Sound Proofs
Sort
View
NETWORKS
2011
14 years 10 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
TCS
2011
14 years 10 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader
TCS
2010
14 years 10 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
CIE
2009
Springer
15 years 10 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
GD
2006
Springer
15 years 7 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis