Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Baltz, Andreas - Institut für Informatik, Christian-Albrechts-Universität Kiel
Constructions of Sparse Asymmetric Connectors with Number Theoretic Methods
On the b-partite Directed Random Traveling Salesman Problem and its Assignment Relaxation
Algorithmic and Probabilistic Aspects of the Bipartite Traveling Salesman Problem
Fast Approximation of Minimum Multicast Congestion { Implementation versus Theory
Prof. Dr. Anand Srivastav Christian--Albrechts--Universit at zu Kiel
Prof. Dr. Anand Srivastav Christian--Albrechts--Universit at zu Kiel
Approximation Algorithms for the Euclidean Bipartite TSP
On the Minimum Load Coloring Problem Extended Abstract
Coloring Graphs with Minimal Edge Load Nitin Ahuja Andreas Baltz Benjamin Doerr
Prof. Dr. Anand Srivastav Christian--Albrechts--Universit at zu Kiel
The Structure of Maximum Subsets of {1, . . . , n} with no Solutions to a + b = kc
Constructions of Sparse Asymmetric Connectors Andreas Baltz, Gerold Jager, and Anand Srivastav
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching and
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets
Prof. Dr. Anand Srivastav Christian--Albrechts--Universit at zu Kiel
