📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs (2017)

First Author: Bonnet

Attributed to: Fixed-parameter tractability for geometric optimization problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1712.05010

Publication URI: https://arxiv.org/abs/1712.05010v2

Type: Journal Article/Review

Parent Publication: arXiv e-prints