Non-oblivious local search for graph and hypergraph coloring problems

DOI10.1007/3-540-60618-1_74MaRDI QIDQ6122220

Paola Alimonti

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search, reducibility and approximability of NP-optimization problems
• How easy is local search?
• Optimization, approximation, and complexity classes
• Graph Algorithms for Functional Dependency Manipulation
• Closures of database hypergraphs
• On-line algorithms for polynomially solvable satisfiability problems

This page was built for publication: Non-oblivious local search for graph and hypergraph coloring problems