Pages that link to "Item:Q2427738"

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

Displaying 10 items.

• 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)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← 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)
• A ``maximum node clustering'' problem (Q2479564) (← links)
• Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)