Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Mark de Berg, Andrés López Martínez, and Frits Spieksma. Finding Diverse Minimum s-t Cuts. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 24:1-24:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2023.24, author = {de Berg, Mark and L\'{o}pez Mart{\'\i}nez, Andr\'{e}s and Spieksma, Frits}, title = {{Finding Diverse Minimum s-t Cuts}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {24:1--24:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.24}, URN = {urn:nbn:de:0030-drops-193267}, doi = {10.4230/LIPIcs.ISAAC.2023.24}, annote = {Keywords: S-T MinCut, Diversity, Lattice Theory, Submodular Function Minimization} }
Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Mark de Berg, Arpan Sadhukhan, and Frits Spieksma. Stable Approximation Algorithms for Dominating Set and Independent Set. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 27:1-27:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{deberg_et_al:LIPIcs.APPROX/RANDOM.2023.27, author = {de Berg, Mark and Sadhukhan, Arpan and Spieksma, Frits}, title = {{Stable Approximation Algorithms for Dominating Set and Independent Set}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {27:1--27:19}, 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.27}, URN = {urn:nbn:de:0030-drops-188527}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.27}, annote = {Keywords: Dynamic algorithms, approximation algorithms, stability, dominating set, independent set} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Thomas Erlebach, Kelin Luo, and Frits C.R. Spieksma. Package Delivery Using Drones with Restricted Movement Areas. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 49:1-49:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{erlebach_et_al:LIPIcs.ISAAC.2022.49, author = {Erlebach, Thomas and Luo, Kelin and Spieksma, Frits C.R.}, title = {{Package Delivery Using Drones with Restricted Movement Areas}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {49:1--49:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.49}, URN = {urn:nbn:de:0030-drops-173343}, doi = {10.4230/LIPIcs.ISAAC.2022.49}, annote = {Keywords: Mobile agents, approximation algorithm, inapproximability} }
Published in: LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
Mark de Berg, Arpan Sadhukhan, and Frits Spieksma. Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 15:1-15:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{deberg_et_al:LIPIcs.SWAT.2022.15, author = {de Berg, Mark and Sadhukhan, Arpan and Spieksma, Frits}, title = {{Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {15:1--15:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-236-5}, ISSN = {1868-8969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.15}, URN = {urn:nbn:de:0030-drops-161756}, doi = {10.4230/LIPIcs.SWAT.2022.15}, annote = {Keywords: Computational geometry, online algorithms, broadcast range assignment, stable approximation schemes} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, and Frits C. R. Spieksma. Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 45:1-45:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ficker_et_al:LIPIcs.ISAAC.2018.45, author = {Ficker, Annette M. C. and Erlebach, Thomas and Mihal\'{a}k, Mat\'{u}s and Spieksma, Frits C. R.}, title = {{Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.45}, URN = {urn:nbn:de:0030-drops-99933}, doi = {10.4230/LIPIcs.ISAAC.2018.45}, annote = {Keywords: approximation algorithm, matching, clustering problem} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Ward Passchyn, Dirk Briskorn, and Frits C.R. Spieksma. Mathematical programming models for scheduling locks in sequence. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 92-106, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{passchyn_et_al:OASIcs.ATMOS.2014.92, author = {Passchyn, Ward and Briskorn, Dirk and Spieksma, Frits C.R.}, title = {{Mathematical programming models for scheduling locks in sequence}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {92--106}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.92}, URN = {urn:nbn:de:0030-drops-47553}, doi = {10.4230/OASIcs.ATMOS.2014.92}, annote = {Keywords: Mixed Integer Programming, Inland Waterways, Lock Scheduling} }
Published in: OASIcs, Volume 20, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2011)
Sofie Coene and Frits C. R. Spieksma. The Lockmaster's problem. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 20, pp. 27-37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
@InProceedings{coene_et_al:OASIcs.ATMOS.2011.27, author = {Coene, Sofie and Spieksma, Frits C. R.}, title = {{The Lockmaster's problem}}, booktitle = {11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {27--37}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-33-0}, ISSN = {2190-6807}, year = {2011}, volume = {20}, editor = {Caprara, Alberto and Kontogiannis, Spyros}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2011.27}, URN = {urn:nbn:de:0030-drops-32647}, doi = {10.4230/OASIcs.ATMOS.2011.27}, annote = {Keywords: lock scheduling, batch scheduling, dynamic programming, complexity} }
Published in: OASIcs, Volume 14, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) (2010)
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, and Pieter Vansteenwegen. Heuristics for the Traveling Repairman Problem with Profits. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 34-44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{dewilde_et_al:OASIcs.ATMOS.2010.34, author = {Dewilde, Thijs and Cattrysse, Dirk and Coene, Sofie and Spieksma, Frits C. R. and Vansteenwegen, Pieter}, title = {{Heuristics for the Traveling Repairman Problem with Profits}}, booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)}, pages = {34--44}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-20-0}, ISSN = {2190-6807}, year = {2010}, volume = {14}, editor = {Erlebach, Thomas and L\"{u}bbecke, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.34}, URN = {urn:nbn:de:0030-drops-27489}, doi = {10.4230/OASIcs.ATMOS.2010.34}, annote = {Keywords: Traveling Repairman, Profits, Latency, Tabu Search, Relief Efforts} }
Feedback for Dagstuhl Publishing