Frontiers in service science: Ride matching for peer-to-peer ride sharing: A review and future directions

A Tafreshian, N Masoud, Y Yin - Service Science, 2020 - pubsonline.informs.org
As a consequence of the sharing economy attaining more popularity, there has been a shift
toward shared-use mobility services in recent years, especially those that encourage users …

Combinatorial optimization of graphical user interface designs

A Oulasvirta, NR Dayama, M Shiripour… - Proceedings of the …, 2020 - ieeexplore.ieee.org
The graphical user interface (GUI) has become the prime means for interacting with
computing systems. It leverages human perceptual and motor capabilities for elementary …

Popular conjectures imply strong lower bounds for dynamic problems

A Abboud, VV Williams - 2014 IEEE 55th Annual Symposium …, 2014 - ieeexplore.ieee.org
We consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …

Linear-time approximation for maximum weight matching

R Duan, S Pettie - Journal of the ACM (JACM), 2014 - dl.acm.org
The maximum cardinality and maximum weight matching problems can be solved in Õ (m√
n) time, a bound that has resisted improvement despite decades of research.(Here m and n …

Energy-efficient and physical-layer secure computation offloading in blockchain-empowered internet of things

Y Liu, Z Su, Y Wang - IEEE Internet of Things Journal, 2022 - ieeexplore.ieee.org
This article investigates computation offloading in blockchain-empowered Internet of Things
(IoT), where the task data uploading link from sensors to a base station (BS) is protected by …

Exploration via hindsight goal generation

Z Ren, K Dong, Y Zhou, Q Liu… - Advances in Neural …, 2019 - proceedings.neurips.cc
Goal-oriented reinforcement learning has recently been a practical framework for robotic
manipulation tasks, in which an agent is required to reach a certain goal defined by a …

A bipartite matching-based feature selection for multi-label learning

A Hashemi, MB Dowlatshahi… - International journal of …, 2021 - Springer
Many real-world data have multiple class labels known as multi-label data, where the labels
are correlated with each other, and as such, they are not independent. Since these data are …

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time

MB Cohen, A Mądry, P Sankowski, A Vladu - Proceedings of the Twenty …, 2017 - SIAM
In this paper, we study a set of combinatorial optimization problems on weighted graphs: the
shortest path problem with negative weights, the weighted perfect bipartite matching …

[PDF][PDF] On minimum-cost assignments in unbalanced bipartite graphs

L Ramshaw, RE Tarjan - HP Labs, Palo Alto, CA, USA, Tech. Rep …, 2012 - labs.hpe.com
Consider a bipartite graph G=(X; Y; E) with real-valued weights on its edges, and suppose
that G is balanced, with| X|=| Y|. The assignment problem asks for a perfect matching in G of …

Discrete-convex-analysis-based framework for warm-starting algorithms with predictions

S Sakaue, T Oki - Advances in Neural Information …, 2022 - proceedings.neurips.cc
Augmenting algorithms with learned predictions is a promising approach for going beyond
worst-case bounds. Dinitz, Im, Lavastida, Moseley, and Vassilvitskii~(2021) have …