Zobrazeno 1 - 10
of 434
pro vyhledávání: '"ORLIN, JAMES B."'
We present a new optimization-based method for aggregating preferences in settings where each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial order is motivated by the observation that collectio
Externí odkaz:
http://arxiv.org/abs/2307.15702
Autor:
ORLIN, JAMES B.1 jorlin@mit.edu, VÉGH, LÁSZLÓ2 l.vegh@lse.ac.uk
Publikováno v:
Journal of the ACM. Feb2023, Vol. 70 Issue 1, p1-33. 33p.
Autor:
Orlin, James B., Végh, László A.
We present an $O(nm)$ algorithm for all-pairs shortest paths computations in a directed graph with $n$ nodes, $m$ arcs, and nonnegative integer arc costs. This matches the complexity bound attained by Thorup \cite{Thorup1999} for the all-pairs proble
Externí odkaz:
http://arxiv.org/abs/2007.07975
Autor:
Orlin, James B., Gong, Xiao-Yue
In 2013, Orlin proved that the max flow problem could be solved in $O(nm)$ time. His algorithm ran in $O(nm + m^{1.94})$ time, which was the fastest for graphs with fewer than $n^{1.06}$ arcs. If the graph was not sufficiently sparse, the fastest run
Externí odkaz:
http://arxiv.org/abs/1910.04848
Publikováno v:
Mathematical Programming, 172(1), 505-537, 2018
We consider a robust formulation, introduced by Krause et al. (2008), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results. The robustness considered is w
Externí odkaz:
http://arxiv.org/abs/1507.06616
Autor:
Nasrabadi, Ebrahim, Orlin, James B.
In this paper, we consider an adaptive approach to address optimization problems with uncertain cost parameters. Here, the decision maker selects an initial decision, observes the realization of the uncertain cost parameters, and then is permitted to
Externí odkaz:
http://arxiv.org/abs/1312.4075
Network interdiction can be viewed as a game between two players, an "interdictor" and a "flow player". The flow player wishes to send as much material as possible through a network, while the interdictor attempts to minimize the amount of transporte
Externí odkaz:
http://arxiv.org/abs/1312.3478
Publikováno v:
In Discrete Applied Mathematics 19 February 2018 236:387-394
Autor:
Csirik, Janos, Johnson, David S., Kenyon, Claire, Orlin, James B., Shor, Peter W., Weber, Richard R.
In this paper we present a theoretical analysis of the deterministic on-line {\em Sum of Squares} algorithm ($SS$) for bin packing introduced and studied experimentally in \cite{CJK99}, along with several new variants. $SS$ is applicable to any insta
Externí odkaz:
http://arxiv.org/abs/cs/0210013
Publikováno v:
Management Science, 2003 Jul 01. 49(7), 950-964.
Externí odkaz:
https://www.jstor.org/stable/4133968