Projects funded by the NCN
Allocation of tasks in computer networks
2011/03/N/ST6/04404
Keywords:
domination in graphs assignment problem quadratic assignment problem approximation algorithm NP-completeness
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST6_3: Software engineering, operating systems, software development methods, programming languages
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
POLITECHNIKA GDAŃSKA
woj. pomorskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 2 - announced on 2011-09-15
Amount awarded: 69 000 PLN
Project start date (Y-m-d): 2012-09-05
Project end date (Y-m-d): 2013-11-07
Project duration:: 14 months (the same as in the proposal)
Project status: Project settled
Information in the final report
- Publication in academic press/journals (1)
- Articles in post-conference publications (1)
- Trees having many minimal dominating setsAuthors:Marcin KrzywkowskiAcademic press:Information Processing Letters (rok: 2013, tom: 113, strony: 276-279), Wydawca: ElsevierStatus:PublishedDOI:10.1016/j.ipl.2013.01.020 - link to the publication
- An algorithm for listing all minimal 2-dominating sets of a treeAuthors:Marcin KrzywkowskiConference:FAW-AAIM 2013 (rok: 2013, ), Wydawca: Springer, Lecture Notes in Computer ScienceData:konferencja 26-28 czerwca 2013r.Status:Published