Tim Nonner

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Clique clustering yields a PTAS for max-coloring interval graphs Algorithmica	2018-07-26	Paper
PTAS for densest \(k\)-subgraph in interval graphs Algorithmica	2016-03-23	Paper
Capacitated max-batching with interval graph compatibilities Theoretical Computer Science	2015-12-28	Paper
SRPT is 1.86-competitive for completion time scheduling	2014-05-22	Paper
The bell is ringing in speed-scaled multiprocessor scheduling Theory of Computing Systems	2014-03-25	Paper
An efficient polynomial-time approximation scheme for the joint replenishment problem Integer Programming and Combinatorial Optimization	2013-03-19	Paper
Optimal algorithms for train shunting and relaxed list update problems	2012-10-02	Paper
Polynomial-time approximation schemes for shortest path with alternatives Algorithms – ESA 2012	2012-09-25	Paper
PTAS for Densest k-Subgraph in Interval Graphs Lecture Notes in Computer Science	2011-08-12	Paper
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs Automata, Languages and Programming	2011-07-06	Paper
Capacitated max-batching with interval graph compatibilities Lecture Notes in Computer Science	2010-06-22	Paper
APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES Discrete Mathematics, Algorithms and Applications	2009-09-22	Paper
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines Combinatorial Optimization and Applications	2009-07-07	Paper
Latency Constrained Aggregation in Chain Networks Admits a PTAS Algorithmic Aspects in Information and Management	2009-07-02	Paper

Research outcomes over time

This page was built for person: Tim Nonner