scientific article; zbMATH DE number 1332666
From MaRDI portal
Publication:4259987
Recommendations
Cited in
(23)- Hardness results for neural network approximation problems
- Affine reductions for LPs and SDPs
- On weighted vs unweighted versions of combinatorial optimization problems
- On local search for the generalized graph coloring problem
- A class of spectral bounds for max \(k\)-cut
- On approximate learning by multi-layered feedforward circuits
- Approximate Max k-Cut with subgraph guarantee
- Hardness of Graph Pricing Through Generalized Max-Dicut
- Approximation and hardness results for the max \(k\)-uncut problem
- How to Cut a Graph into Many Pieces
- Approximability Distance in the Space of H-Colourability Problems
- A framework for solving mixed-integer semidefinite programs
- Algorithmic aspects of homophyly of networks
- scientific article; zbMATH DE number 7564377 (Why is no real title available?)
- A multiple search operator heuristic for the max-k-cut problem
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Maximizing agreements with one-sided error with applications to heuristic learning
- Maximizing agreements with one-sided error with applications to heuristic learning
- Building a small and informative phylogenetic supertree
- Approximation schemes for Min-Sum \(k\)-Clustering
- Inapproximability of counting hypergraph colourings
- Dual-based approximation algorithms for cut-based network connectivity problems
- The capacitated max \(k\)-cut problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259987)
