Threshold-based preprocessing for approximating the weighted dense k-subgraph problem
Year of publication: |
2014
|
---|---|
Authors: | Borgwardt, Steffen Alexander ; Schmiedl, F. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 234.2014, 3 (1.5.), p. 631-640
|
Subject: | (I) Graph theory | OR in forestry | Dense subgraph | Approximation algorithms | Graphentheorie | Graph theory | Algorithmus | Algorithm | Forstwirtschaft | Forestry | Mathematische Optimierung | Mathematical programming |
-
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
Grout, Logan, (2023)
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
-
Flexible bandwidth assignment with application to optical networks
Shachnai, Hadas, (2018)
- More ...
-
Threshold-based preprocessing for approximating the weighted dense k-subgraph problem
Borgwardt, S., (2014)
-
Constrained minimum-k-star clustering and its application to the consolidation of farmland
Borgwardt, Steffen Alexander, (2011)
-
A note on the approximability of deepest-descent circuit steps
Borgwardt, Steffen Alexander, (2021)
- More ...