scientific article; zbMATH DE number 1332666

zbMATH Open0924.68013MaRDI QIDQ4259987FDOQ4259987

Authors: Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi 

Publication date: 8 September 1999

Title of this publication is not available (Why is that?)

Recommendations

• Approximate Max \(k\)-Cut with subgraph guarantee
• Approximation and hardness results for the max \(k\)-uncut problem
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
• scientific article; zbMATH DE number 1670644

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited In (22)

• A framework for solving mixed-integer semidefinite programs
• On approximate learning by multi-layered feedforward circuits
• On local search for the generalized graph coloring problem
• Approximation and hardness results for the max \(k\)-uncut problem
• Dual-based approximation algorithms for cut-based network connectivity problems
• Approximate Max \(k\)-Cut with subgraph guarantee
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• A class of spectral bounds for max \(k\)-cut
• Title not available (Why is that?)
• Maximizing agreements with one-sided error with applications to heuristic learning
• Building a small and informative phylogenetic supertree
• Hardness of Graph Pricing Through Generalized Max-Dicut
• Maximizing agreements with one-sided error with applications to heuristic learning
• Hardness results for neural network approximation problems
• How to Cut a Graph into Many Pieces
• Algorithmic aspects of homophyly of networks
• Approximability Distance in the Space of H-Colourability Problems
• Approximation schemes for Min-Sum \(k\)-Clustering
• The capacitated max \(k\)-cut problem
• A multiple search operator heuristic for the max-k-cut problem
• On weighted vs unweighted versions of combinatorial optimization problems
• Affine reductions for LPs and SDPs

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)