Go to the corresponding LIPIcs Volume Portal 
Goemans, Michel X. ; Unda, Francisco
pdfformat: 

@InProceedings{goemans_et_al:LIPIcs:2017:7555, author = {Michel X. Goemans and Francisco Unda}, title = {{Approximating Incremental Combinatorial Optimization Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {6:16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7555}, URN = {urn:nbn:de:0030drops75559}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.6}, annote = {Keywords: Approximation algorithm, matching, incremental problems, matroid intersection, integral polytopes, stable sets} }
Keywords:  Approximation algorithm, matching, incremental problems, matroid intersection, integral polytopes, stable sets  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 