The following pages link to (Q4259987):
Displaying 21 items.
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
- Hardness of Graph Pricing Through Generalized Max-Dicut (Q2941530) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- (Q5091725) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
- Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)
