Travelled to:1 × Denmark
1 × France
1 × Japan
1 × United Kingdom
Collaborated with:T.Mömke M.Skutella J.Verschae W.Höhn J.Mestre A.Marchetti-Spaccamela C.Rutten S.v.d.Ster N.Megow F.Eisenbrand N.Hähnle M.Niemeier
Talks about:schedul (2) task (2) algorithm (1) unsplitt (1) parallel (1) function (1) approxim (1) recours (1) problem (1) environ (1)
Person: Andreas Wiese
DBLP: Wiese:Andreas
Contributed to:
2015201420122010Wrote 5 papers:
- ICALP-v1-2015-MomkeW #algorithm #approximate #problem
- A (2+ε)-Approximation Algorithm for the Storage Allocation Problem (TM, AW), pp. 973–984.
- ICALP-v1-2014-HohnMW #cost analysis #how #scheduling
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (WH, JM, AW), pp. 625–636.
- ICALP-v1-2012-Marchetti-SpaccamelaRSW #parallel
- Assigning Sporadic Tasks to Unrelated Parallel Machines (AMS, CR, SvdS, AW), pp. 665–676.
- ICALP-v1-2012-MegowSVW #online #power of
- The Power of Recourse for Online MST and TSP (NM, MS, JV, AW), pp. 689–700.
- ICALP-v1-2010-EisenbrandHNSVW #realtime #scheduling
- Scheduling Periodic Tasks in a Hard Real-Time Environment (FE, NH, MN, MS, JV, AW), pp. 299–311.