Conference Information

APPROX 2026: International Conference on Approximation Algorithms for Combinatorial Optimization Problems

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
APPROX
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2026-05-06
Notification Date:
2026-06-25
Conference Date:
2026-08-19
Location:
Boston, Massachusetts, USA
Years:
ICORE: A   QUALIS: B1   Viewed: 24404   Tracked: 1   Attend: 0

Conference Partner Index (CP-I)

74.3 / 100
Ranked #274 of 5,682 conferences · Top 5%

#19 of 142 in Theory & Algorithms

Academic recognition (35%)
88
Submission selectivity (20%)
54
Editions held (20%)
92
Community attention (10%)
17
Public record completeness (15%)
85

Inputs used: Listed as ICORE A, QUALIS B1 · Acceptance rate: 50.5% (mean of 5 editions on file) · Editions on record: 29 · Researchers following it here: 1 · Researchers who opened this page in the past 24 months: 3

Missing from the public record: Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 100% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-14

Call For Papers

APPROX 2026 (International Conference on Approximation Algorithms for Combinatorial Optimization Problems) is a ICORE A / QUALIS B1 conference held in Boston, Massachusetts, USA on 2026-08-19. The paper submission deadline is 2026-05-06. Acceptance notifications are sent on 2026-06-25.

Scope Papers are solicited in all research areas related to approximation, including but not limited to: 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 algorithmic game theory, mechanism design and economics computational geometric problems approximate learning
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 46.6% over 15 years (2008–2022).

YearSubmittedAcceptedAccepted(%)
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%

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Journal of Combinatorial Optimization1.1Springer1382-6905
Mathematical Problems in EngineeringHindawi1024-123X
Problems of Information Transmission0.9Springer0032-9460
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655

Comments 0

No comments yet.

Please Login to post a comment