Approximation and Online Algorithms: 23rd International Workshop, Waoa 2025, Warsaw, Poland, September 18-19, 2025, Proceedings
暫譯: 近似與線上演算法:第23屆國際研討會 Waoa 2025,波蘭華沙,2025年9月18-19日,會議論文集

Matuschke, Jannik, Verschae, José

  • 出版商: Springer
  • 出版日期: 2025-10-02
  • 售價: $2,960
  • 貴賓價: 9.5$2,812
  • 語言: 英文
  • 頁數: 229
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 3032067057
  • ISBN-13: 9783032067050
  • 相關分類: Algorithms-data-structures
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation and Online Algorithms, WAOA 2025, held in Warsaw, Poland, during September 18-19, 2025.

The 15 full papers included in this book were carefully reviewed and selected from 43 submissions. WAOA 2025 invited submissions on topics related to approximation and online algorithms, including algorithmic game theory, coloring and partitioning, computational economics and mechanism design, experimental methods for approximation and online algorithms, FPT-approximation algorithms, geometric problems, graph algorithms and network design, inapproximability results, packing and covering, matroids and submodular functions, new paradigms in approximation and online optimization, online selection problems, resource augmentation, relaxations and tightness of formulations, robust and stochastic problems, and scheduling problems.

商品描述(中文翻譯)

本書為第23屆國際近似與線上演算法研討會(WAOA 2025)的經過審稿的會議論文集,該會議於2025年9月18日至19日在波蘭華沙舉行。

本書收錄的15篇完整論文是從43篇投稿中仔細審核和選出的。WAOA 2025徵求與近似和線上演算法相關的主題投稿,包括演算法遊戲理論、著色與分割、計算經濟學與機制設計、近似和線上演算法的實驗方法、FPT-近似演算法、幾何問題、圖演算法與網路設計、不可近似性結果、打包與覆蓋、矩陣與次模函數、近似和線上優化的新範式、線上選擇問題、資源增強、放鬆與公式的緊密性、穩健與隨機問題,以及排程問題。