Pages that link to "Item:Q2775885"

The following pages link to Approximation algorithms for maximization problems arising in graph partitioning (Q2775885):

Displaying 50 items.

• PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
• Online maximum \(k\)-coverage (Q442204) (← links)
• Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• Distributed discovery of large near-cliques (Q661050) (← links)
• A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
• Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• The capacitated max \(k\)-cut problem (Q930343) (← links)
• Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
• Graph bisection revisited (Q1657405) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
• On approximation of max-vertex-cover (Q1848386) (← links)
• Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders (Q2029376) (← links)
• Parameterized complexity of multi-node hubs (Q2084737) (← links)
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
• On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
• Finding connected \(k\)-subgraphs with high density (Q2407097) (← 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)
• Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
• Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• Tight approximation algorithms for maximum separable assignment problems (Q2884281) (← links)
• Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
• Super-polynomial approximation branching algorithms (Q2954364) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• Online Maximum k-Coverage (Q3088282) (← links)
• An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
• (Q3748301) (← links)
• (Q3807893) (← links)
• (Q4251055) (← links)
• Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
• Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)
• Finding a Dense-Core in Jellyfish Graphs (Q5458298) (← links)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465866) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)