Exact and superpolynomial approximation algorithms for the densest k-subgraph problem
Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
| Year of publication: |
1 November 2017
|
|---|---|
| Authors: | Bourgeois, Nicolas ; Giannakos, Aristotelis ; Lucarelli, Giorgio ; Milis, Ioannis ; Paschos, Vangelis Th. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 262.2017, 3 (1.11.), p. 894-903
|
| Subject: | Combinatorial optimization | Dense subgraphs | Exact and parameterized algorithms | Superpolynomial approximation algorithms | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2017.04.034 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011802282