Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[4]
Hilfe
Suche: Author="Newman, Alantha"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph-TSP from Steiner cycles
Satoru Iwata
,
Alantha Newman
,
R. Ravi
Lecture Notes in Computer Science
8747
, 2014, pp. 312-323
On the configuration LP for maximum budgeted allocation
Christos Kalaitzis
,
Aleksander Ma̧dry
,
Alantha Newman
,
Lukás̑ Polác̑ek
,
Ola Svensson
Lecture Notes in Computer Science
8494
, 2014, pp. 333-344
An improved analysis of the Mömke-Svensson algorithm for graph-TSP on subquartic graphs
Alantha Newman
Lecture Notes in Computer Science
8737
, 2014, pp. 737-749
Aggregating inconsistent information: Ranking and clustering
Nir Ailon
,
Moses Charikar
,
Alantha Newman
Journal of the ACM
55
(5), 2008, pp. 23: 1-27
Decision-making based on approximate and smoothed Pareto curves
Heiner Ackermann
,
Alantha Newman
,
Heiko Röglin
,
Berthold Vöcking
Theoretical Computer Science
378
(3), 2007, pp. 253-270
Decision making based on approximate and smoothed Pareto curves
Heiner Ackermann
,
Alantha Newman
,
Heiko Röglin
,
Berthold Vöcking
Lecture Notes in Computer Science
3827
, 2005, pp. 675-684
Aggregating inconsistent information: Ranking and clustering
Nir Ailon
,
Moses Charikar
,
Alantha Newman
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 684-693
Fences are futile: On relaxations for the linear ordering problem
Alantha Newman
,
Santosh Vempala
Lecture Notes in Computer Science
2081
, 2001, pp. 333-347