会議情報
APPROX 2017: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
会議のウェブサイトを表示するにはログインしてください

提出日:
2017-04-21
通知日:
2017-06-02
会議日:
2017-08-16
場所:
Berkeley, California, USA
年:
20
CORE: a   QUALIS: b1   閲覧: 19012   追跡: 1   出席: 0

論文募集
approximation algorithms
hardness of approximation
small space, sub-linear time and streaming algorithms
online algorithms
approaches that go beyond worst case analysis
distributed and parallel approximation​
embeddings and metric space methods
mathematical programming methods
spectral methods
combinatorial optimization in graphs and networks
algorithmic game theory, mechanism design and economics
computational geometric problems
approximate learning
最終更新 Dou Sun 2017-09-30
合格率
時間提出受け入れ受け入れ(%)
2022462452.2%
2021622743.5%
2020673450.7%
2019663350%
2018502856%
2017602236.7%
2016402050%
2015612642.6%
2014643148.4%
2013462350%
2012702840%
2011662943.9%
2010662842.4%
2009562544.6%
2008422047.6%
関連仕訳帳
CCF完全な名前インパクト ・ ファクター出版社ISSN
Structural and Multidisciplinary Optimization4.0Springer1615-147X
Foundations of Computational Mathematics2.7Springer1615-3375
Computational Optimization and Applications2.0Springer0926-6003
Applied Mathematics & Optimization1.7Springer0095-4616
ACM Transactions on Spatial Algorithms and Systems1.6ACM2374-0353
aACM Transactions on Architecture and Code Optimization1.500ACM1544-3566
Numerical Functional Analysis and Optimization1.400Taylor & Francis0163-0563
bJournal of Global Optimization1.300Springer0925-5001
Journal of Combinatorial Optimization0.900Springer1382-6905
Automation and Remote Control0.600Springer0005-1179