New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

BIT*アルゴリズムの理解 #68

Open

HiroIshida opened this issue Oct 8, 2024 · 0 comments

Owner

HiroIshida commented Oct 8, 2024 •

edited

Loading

$min (Q_V) > min (Q_E)$ となるまでexpandを繰り返すのは, 左辺は$Q_V$によるコストのlower boundであり, Q_Eはコネクションをした場合に推定されるものなので, これによってlower boundを下げることができる可能性があるため.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment