AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Deeper Treatment of the Bi-objective Search Framework

Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Carlos Hernández Ulloa, Sven Koenig

AAAI 2026 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace linear-time dominance check with constant-time DC for MIN (ablation)MIN ordering function in BOS-A* · New York (100 instances)runtime (s): 5,189 -> 32Improved
replace linear-time dominance check with constant-time DC for MAX (ablation)MAX ordering function in BOS-A* · Colorado (100 instances)runtime (s): 6,338 -> 42Improved
use MIN instead of LEX/MAX orderingBOS-A* · road maps, solutions found vs expansionsfraction of POF found earlyImproved
choice of ordering function (LEX1, LEX2, MIN, MAX) with constant-time DC (ablation)BOS-A* · Bay (575 instances)total runtime (s): 51.86 to 54.06No clear effect
MIN/MAX store two f-min values instead of one scalarconstant-time DC · Bay (575 instances)comparisons: 954,897 -> 1,684,661 (LEX1 vs MIN)Hurt
exploit extra PDC pruning idea in MIN constant-time DC (L1/L2 cross-check)MIN · road mapsruntimeNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy