The following pages link to (Q3499508):
Displaying 37 items.
- Sharp spectral bounds of several graph parameters using eigenvector norms (Q286136) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- A new Lagrangian net algorithm for solving max-bisection problems (Q544198) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Laplacian eigenvalues and fixed size multisection (Q1422418) (← links)
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- A representation theory perspective on simultaneous alignment and classification (Q2197957) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
- Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. (Q2773169) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning (Q3453578) (← links)
- (Q3573969) (← links)
- Realignment in the National Football League: Did they do it right? (Q4456091) (← links)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
- (Q4636989) (← links)
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method (Q4645921) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Three candidate plurality is stablest for small correlations (Q5154790) (← links)
- Complex semidefinite programming and Max-\(k\)-Cut (Q5240428) (← links)
- (Q5440597) (← links)
- Energy Efficient Monitoring in Sensor Networks (Q5458549) (← links)
- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection (Q5741729) (← links)
- 10 problems for partitions of triangle-free graphs (Q6612517) (← links)
