Table of Contents: :: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yang, Shang-Ru, Liao, Yung-Han, Chien, Chih-Ching, Wu, Hao-Hsiang
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2412.11071
Tags:	Add Tag No Tags, Be the first to tag this record!

Table of Contents:

Csáji, Jungers, and Blondel prove that while a PageRank optimization problem with edge selection constraints is NP-hard, it can be solved optimally in polynomial time for the unconstrained case. This theoretical result is accompanied by several observations, which we leverage to develop valid inequalities in polynomial time for this class of NP-hard problems.