Opendata, web and dolomites

APEG SIGNED

Algorithmic Performance Guarantees: Foundations and Applications

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "APEG" data sheet

The following table provides information about the project.

Coordinator
TECHNISCHE UNIVERSITAET MUENCHEN 

Organization address
address: Arcisstrasse 21
city: MUENCHEN
postcode: 80333
website: www.tu-muenchen.de

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Germany [DE]
 Project website http://www14.in.tum.de/projekte/erc/index.html.en
 Total cost 2˙404˙250 €
 EC max contribution 2˙404˙250 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2015-AdG
 Funding Scheme ERC-ADG
 Starting year 2016
 Duration (year-month-day) from 2016-10-01   to  2021-09-30

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    TECHNISCHE UNIVERSITAET MUENCHEN DE (MUENCHEN) coordinator 2˙404˙250.00

Map

 Project objective

Optimization problems are ubiquitous in computer science. Almost every problem involves the optimization of some objective function. However a major part of these problems cannot be solved to optimality. Therefore, algorithms that achieve provably good performance guarantees are of immense importance. Considerable progress has already been made, but great challenges remain: Some fundamental problems are not well understood. Moreover, for central problems arising in new applications, no solutions are known at all.

The goal of APEG is to significantly advance the state of the art on algorithmic performance guarantees. Specifically, the project has two missions: First, it will develop new algorithmic techniques, breaking new ground in the areas of online algorithms, approximations algorithms and algorithmic game theory. Second, it will apply these techniques to solve fundamental problems that are central in these algorithmic disciplines. APEG will attack long-standing open problems, some of which have been unresolved for several decades. Furthermore, it will formulate and investigate new algorithmic problems that arise in modern applications. The research agenda encompasses a broad spectrum of classical and timely topics including (a) resource allocation in computer systems, (b) data structuring, (c) graph problems, with relations to Internet advertising, (d) complex networks and (e) massively parallel systems. In addition to basic optimization objectives, the project will also study the new performance metric of energy minimization in computer systems.

Overall, APEG pursues cutting-edge algorithms research, focusing on both foundational problems and applications. Any progress promises to be a breakthrough or significant contribution.

 Publications

year authors and title journal last update
List of publications.
2019 Susanne Albers, Dennis Kraft
Motivating Time-Inconsistent Agents: A Computational Approach
published pages: 466-487, ISSN: 1432-4350, DOI: 10.1007/s00224-018-9883-0
Theory of Computing Systems 63/3 2019-09-02
2016 Susanne Albers, Dennis Kraft
Motivating Time-Inconsistent Agents: A Computational Approach
published pages: 309-323, ISSN: , DOI: 10.1007/978-3-662-54110-4_22
12th International Conference on Web and Internet Economics (WINE 2016) Springer LNCS 10123 2019-06-17
2016 Gálvez, Waldo; Grandoni, Fabrizio; Ingala, Salvatore; Khan, Arindam
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
published pages: 9:1 -- 9:14, ISSN: , DOI: 10.4230/LIPIcs.FSTTCS.2016.9
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016) 65 2019-06-17
2016 Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Scheduling on Power-Heterogeneous Processors.
published pages: 41-54, ISSN: , DOI: 10.1007/978-3-662-49529-2_4
12th Latin American Symposium on Theoretical Informatics (LATIN 2016) Springer LNCS9644 2019-06-17
2016 Susanne Albers, Sonja Lauer
On list update with locality of reference
published pages: 627-653, ISSN: 0022-0000, DOI: 10.1016/j.jcss.2015.11.005
Journal of Computer and System Sciences 82/5 2019-06-17
2017 Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
Scheduling on power-heterogeneous processors
published pages: 22-33, ISSN: 0890-5401, DOI: 10.1016/j.ic.2017.09.013
Information and Computation 257 2019-06-17
2017 Albers, Susanne; Schraink, Sebastian
Tight Bounds for Online Coloring of Basic Graph Classes
published pages: 7:1 --7:14, ISSN: , DOI: 10.4230/LIPIcs.ESA.2017.7
25th Annual European Symposium on Algorithms (ESA 2017) 87 2019-06-17
2017 Susanne Albers, Matthias Hellwig
On the Value of Job Migration in Online Makespan Minimization
published pages: 598-623, ISSN: 0178-4617, DOI: 10.1007/s00453-016-0209-9
Algorithmica 79/2 2019-06-17
2017 Susanne Albers, Dennis Kraft
On the Value of Penalties in Time-Inconsistent Planning
published pages: 10:1--10:12, ISSN: , DOI: 10.4230/LIPIcs.ICALP.2017.10
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) Volume 80 2019-06-17
2017 Susanne Albers, Dennis Kraft
The Price of Uncertainty in Present-Biased Planning
published pages: 325-339, ISSN: , DOI: 10.1007/978-3-319-71924-5_23
13th International Conference on Web and Internet Economics (WINE 2017) Springer LNCS 10660 2019-06-17
2017 Susanne Albers, Matthias Hellwig
Online Makespan Minimization with Parallel Schedules
published pages: 492-520, ISSN: 0178-4617, DOI: 10.1007/s00453-016-0172-5
Algorithmica 78/2 2019-06-17
2018 Susanne Albers, Dario Frascaria
Quantifying Competitiveness in Paging with Locality of Reference
published pages: 3563-3596, ISSN: 0178-4617, DOI: 10.1007/s00453-018-0406-9
Algorithmica 80/12 2019-06-03
2019 Susanne Albers, Achim Passen
New Online Algorithms for Story Scheduling in Web Advertising
published pages: 1-25, ISSN: 0178-4617, DOI: 10.1007/s00453-018-0428-3
Algorithmica 81/1 2019-06-03

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "APEG" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "APEG" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

PROGRESS (2019)

The Enemy of the Good: Towards a Theory of Moral Progress

Read More  

SUBMODULAR (2019)

The Power of Randomness and Continuity in Submodular Optimization

Read More  

OBSERVE (2020)

Overcoming cellular barriers to therapeutic RNA delivery using extracellular vesicles

Read More