Andreas Baltz

Available identifiers

Publication	Date of Publication	Type
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science	2009-08-06	Paper
Multicast Routing and Design of Sparse Connectors	2009-07-09	Paper
The Price of Anarchy in Selfish Multicast Routing	2008-04-17	Paper
On the minimum load coloring problem	2008-01-11	Paper
Coloring Graphs with Minimal Edge Load	2007-05-29	Paper
Approximation and Online Algorithms	2007-02-12	Paper
Probabilistic analysis for a multiple depot vehicle routing problem	2007-02-07	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper
Network Analysis	2005-11-11	Paper
The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)	2005-11-01	Paper
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory	2005-09-28	Paper
Approximation algorithms for the Euclidean bipartite TSP	2005-08-25	Paper
Constructions of sparse asymmetric connectors with number theoretic methods	2005-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q4437506	2003-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4780794	2002-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q4941832	2002-09-16	Paper
Probabilistic analysis of bipartite traveling salesman problems	2001-10-24	Paper
Probabilistic construction of small strongly sum-free sets via large Sidon sets	2001-01-07	Paper

This page was built for person: Andreas Baltz