Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
George Karakostas and Stavros G. Kolliopoulos. Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 5:1-5:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{karakostas_et_al:LIPIcs.APPROX/RANDOM.2023.5, author = {Karakostas, George and Kolliopoulos, Stavros G.}, title = {{Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.5}, URN = {urn:nbn:de:0030-drops-188305}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.5}, annote = {Keywords: scheduling, maximum weighted throughput, unrelated machines, approximation algorithm, PTAS} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Stavros G. Kolliopoulos and Yannis Moysoglou. Extended Formulation Lower Bounds via Hypergraph Coloring?. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 568-581, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{kolliopoulos_et_al:LIPIcs.STACS.2015.568, author = {Kolliopoulos, Stavros G. and Moysoglou, Yannis}, title = {{Extended Formulation Lower Bounds via Hypergraph Coloring?}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {568--581}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.568}, URN = {urn:nbn:de:0030-drops-49429}, doi = {10.4230/LIPIcs.STACS.2015.568}, annote = {Keywords: linear programming, extended formulations, inapproximability, facility location} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Stavros G. Kolliopoulos and Yannis Moysoglou. Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 297-312, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{kolliopoulos_et_al:LIPIcs.APPROX-RANDOM.2014.297, author = {Kolliopoulos, Stavros G. and Moysoglou, Yannis}, title = {{Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {297--312}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.297}, URN = {urn:nbn:de:0030-drops-47046}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.297}, annote = {Keywords: Approximation Algorithms, Linear Programming, Facility Location} }
Feedback for Dagstuhl Publishing