The Maximum Matrix Contraction Problem

DOI10.1007/978-3-319-45587-7_37zbMath1445.68114OpenAlexW2514546884MaRDI QIDQ2835698

Pierre-Louis Poirion, Dimitri Watel

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_37

zbMATH Keywords

complexitylinear programmingapproximation algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

The Maximum Matrix Contraction Problem

Uses Software

• Julia

Cites Work

• Clique is hard to approximate within \(n^{1-\epsilon}\)
• The Maximum Matrix Contraction Problem
• Computing in Operations Research Using Julia

This page was built for publication: The Maximum Matrix Contraction Problem