Pages that link to "Item:Q2427738"

The following pages link to A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738):

Displaying 24 items.

• Approximation of dense-\(\frac n2\)-subgraph and table compression problems (Q882965) (← links)
• A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• A note on the approximability of the dense subgraph problem. (Q1776068) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
• A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (Q2448193) (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
• A ``maximum node clustering'' problem (Q2479564) (← links)
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
• (Q2753729) (← links)
• Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph (Q2875146) (← links)
• The Densest k-Subhypergraph Problem (Q4636436) (← links)
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
• PTAS for Densest k-Subgraph in Interval Graphs (Q5199279) (← links)
• Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
• The dense \(k\)-subgraph problem (Q5930156) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)