Improved Approximation Bounds for the Minimum Constraint Removal Problem

Conference proceeding

Open access

Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri and Kasturi Varadarajan

Leibniz International Proceedings in Informatics, LIPIcs, Vol.116

01/01/2018

DOI: 10.4230/lipics.approx-random.2018.2

Files and links (1)

url

https://doi.org/10.4230/lipics.approx-random.2018.2View

Published (Version of record) Open Access

Computer Science

Title: Subtitle: Improved Approximation Bounds for the Minimum Constraint Removal Problem
Creators: Sayan Bandyapadhyay
Neeraj Kumar
Subhash Suri
Kasturi Varadarajan
Resource Type: Conference proceeding
Publication Details: Leibniz International Proceedings in Informatics, LIPIcs, Vol.116
DOI: 10.4230/lipics.approx-random.2018.2
ISSN: 1868-8969
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Language: English
Date published: 01/01/2018
Academic Unit: Computer Science
Record Identifier: 9984259485502771

7 Record Views