Objective
Designing efficient algorithms under limitations either on the running time or on the accessibility of the data is a compelling subject in computer science. The first limitation gave rise to approximation theory and the second limitation led to the notion of on-line algorithms. The objectives of this project are of both theoretical and practical significance. First, the project aims to contribute to the development of a unified and well-defined theory, with respect to computation practice, for approximation and on-line algorithms. Second, it aims to exploit this theory in real world applications and lead to practical algorithmic tools. The project will address its objectives focusing on both traditional problems (graph theoretical, scheduling and packing) and problems arising in new information technologies (resource and data management, telecommunication and networks). Designing efficient algorithms under limitations either on the running time or on the accessibility of the data is a compelling subject in computer science. The first limitation gave rise to approximation theory and the second limitation led to the notion of on-line algorithms. The objectives of this project are of both theoretical and practical significance. First, the project aims to contribute to the development of a unified and well-defined theory, with respect to computation practice, for approximation and on-line algorithms. Second, it aims to exploit this theory in real world applications and lead to practical algorithmic tools. The project will address its objectives focusing on both traditional problems (graph theoretical, scheduling and packing) and problems arising in new information technologies (resource and data management, telecommunication and networks).
OBJECTIVES
The first (theoretical) objective is a contribution to the development of a unified well-defined theory, with respect to computation practice, for approximation and on-line algorithms. To this end the project will focus on identifying cornerstone problems, finding reductions among them and understanding the combinatorial structures that lead to efficient approximation algorithms. For on-line problems, the current priority concerns a critical assessment of its basic premises, modelling assumptions and algorithmic techniques. Starting exploiting this theory to real world applications is the second (practical) objective of the project. The theoretically proven algorithms will be used as core algorithmic ideas that reflect the structure of problems.
They need to be fine-tuned to the instances arising in specific applications in order to lead to practical algorithmic tools. Thus, there is a need for implementing and experimenting with the algorithms developed.
DESCRIPTION OF WORK
The project will address the above mentioned questions and will concentrate on both classical problems and problems arising in new information technologies. In particular we will concentrate on graph problems, scheduling and packing problems, telecommunication and networks problems and resource management in computer systems. The theoretical part consists of improving existing ratios and developing new algorithms, exploring open problems, generalizing methods and techniques, proving reductions among problems and unifying all the above in a theory. The practical part consists of implementing algorithms, analysing instances of practical applications, fine-tuning and experimenting and analysing the results, initiating a library of approximation and on-line algorithms.
Fields of science (EuroSciVoc)
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.
You need to log in or register to use this function
Programme(s)
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
Topic(s)
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Call for proposal
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
Data not available
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
Funding Scheme
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
Coordinator
KIEL
Germany
The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.