Go to the corresponding LIPIcs Volume Portal 
Bandyapadhyay, Sayan ; Kumar, Neeraj ; Suri, Subhash ; Varadarajan, Kasturi
pdfformat: 

@InProceedings{bandyapadhyay_et_al:LIPIcs:2018:9406, author = {Sayan Bandyapadhyay and Neeraj Kumar and Subhash Suri and Kasturi Varadarajan}, title = {{Improved Approximation Bounds for the Minimum Constraint Removal Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {2:12:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770859}, ISSN = {18688969}, year = {2018}, volume = {116}, editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9406}, URN = {urn:nbn:de:0030drops94066}, doi = {10.4230/LIPIcs.APPROXRANDOM.2018.2}, annote = {Keywords: Minimum Constraint Removal, Minimum Color Path, Barrier Resilience, Obstacle Removal, Obstacle Free Path, Approximation} }
Keywords:  Minimum Constraint Removal, Minimum Color Path, Barrier Resilience, Obstacle Removal, Obstacle Free Path, Approximation  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)  
Issue Date:  2018  
Date of publication:  02.08.2018 