The following pages link to (Q4400856):
Displaying 17 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset (Q3467871) (← links)
- (Q5743407) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
