Exact and superpolynomial approximation algorithms for the densest k-subgraph problem
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2017.04.034
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ulrich Pferschy & Joachim Schauer, 2016. "Approximation of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 308-318, May.
- Gerold Jäger & Anand Srivastav, 2005. "Improved Approximation Algorithms for Maximum Graph Partitioning Problems," Journal of Combinatorial Optimization, Springer, vol. 10(2), pages 133-167, September.
- N. Bourgeois & A. Giannakos & G. Lucarelli & I. Milis & V. T. Paschos & O. Pottié, 2012. "The max quasi-independent set problem," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 94-117, January.
- Frederic Roupin & Alain Billionnet, 2008. "A deterministic approximation algorithm for the Densest k-Subgraph Problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 3(3), pages 301-314.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
- Tesshu Hanaka, 2023. "Computing densest k-subgraph with structural parameters," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-17, January.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Mourad El Ouali & Helena Fohlin & Anand Srivastav, 2016. "An approximation algorithm for the partial vertex cover problem in hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 846-864, February.
- Federico Della Croce & Vangelis Th. Paschos, 2014. "Efficient algorithms for the max $$k$$ -vertex cover problem," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 674-691, October.
- Britta Schulze & Michael Stiglmayr & Luís Paquete & Carlos M. Fonseca & David Willems & Stefan Ruzika, 2020. "On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 107-132, August.
- Alain Billionnet & Sourour Elloumi & Amélie Lambert & Angelika Wiegele, 2017. "Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 318-331, May.
- Fritz Bökler & Markus Chimani & Mirko H. Wagner, 2022. "On the rectangular knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(1), pages 149-160, August.
- Wu, Qinghua & Hao, Jin-Kao, 2015. "A review on algorithms for maximum clique problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 693-709.
More about this item
Keywords
Combinatorial optimization; Dense subgraphs; Exact and parameterized algorithms; Superpolynomial approximation algorithms;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:262:y:2017:i:3:p:894-903. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.