scientific article; zbMATH DE number 1332666

zbMath0924.68013MaRDI QIDQ4259987

Sanjeev Khanna, Alessandro Panconesi, Jens Lagergren, Viggo Kann

Publication date: 8 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (18)

Approximate Max \(k\)-Cut with subgraph guarantee ⋮ A class of spectral bounds for max \(k\)-cut ⋮ Building a small and informative phylogenetic supertree ⋮ Affine reductions for LPs and SDPs ⋮ The capacitated max \(k\)-cut problem ⋮ A framework for solving mixed-integer semidefinite programs ⋮ Algorithmic aspects of homophyly of networks ⋮ How to Cut a Graph into Many Pieces ⋮ A multiple search operator heuristic for the max-k-cut problem ⋮ Unnamed Item ⋮ Maximizing agreements with one-sided error with applications to heuristic learning ⋮ Maximizing agreements with one-sided error with applications to heuristic learning ⋮ Approximability Distance in the Space of H-Colourability Problems ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks ⋮ On weighted vs unweighted versions of combinatorial optimization problems ⋮ On approximate learning by multi-layered feedforward circuits ⋮ Hardness results for neural network approximation problems ⋮ On local search for the generalized graph coloring problem

This page was built for publication: