Pages that link to "Item:Q1776068"
From MaRDI portal
The following pages link to A note on the approximability of the dense subgraph problem. (Q1776068):
Displaying 8 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Approximation of dense-\(\frac n2\)-subgraph and table compression problems (Q882965) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
- Dense subgraph problems with output-density conditions (Q4962748) (← links)
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
- Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503) (← links)
- The dense \(k\)-subgraph problem (Q5930156) (← links)
