Selfish versus coordinated routing in network games by Stier Moses, Nicolás E

Get full text

Combinatorial optimization problems with concave costs by Stratila, Dan

Get full text

Provably near-optimal algorithms for multi-stage stochastic optimization models in operations management by Shi, Cong

Get full text

Congestion-aware traffic routing for large-scale mobile agent systems by Lim, Sejoon

Get full text

Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems by Pavone, Marco, Frazzoli, Emilio, Treleaven, Kyle Ballantyne

“…The SCP is NP-Hard and the best known approximation algorithm only provides a 9/5 approximation ratio. …”
Get full text
Get full text

Streaming Similarity Search over One Billion Tweets Using Parallel Locality-Sensitive Hashing by Sundaram, Narayanan, Turmukhametova, Aizana Z., Satish, Nadathur, Mostak, Todd, Indyk, Piotr, Madden, Samuel R., Dubey, Pradeep

“…One popular algorithm for similarity search, especially for high dimensional data (where spatial indexes like kd-trees do not perform well) is Locality Sensitive Hashing (LSH), an approximation algorithm for finding similar objects. In this paper, we describe a new variant of LSH, called Parallel LSH (PLSH) designed to be extremely efficient, capable of scaling out on multiple nodes and multiple cores, and which supports high-throughput streaming of new data. …”
Get full text
Get full text
Get full text

Optimal Pricing in Networks with Externalities by Candogan, Utku Ozan, Bimpikis, Kostas, Ozdaglar, Asuman E.

“…Next, we describe an approximation algorithm for finding the optimal set of agents. …”
Get full text
Get full text

AM with Multiple Merlins by Aaronson, Scott, Impagliazzo, Russell, Moshkovitz Aaronson, Dana Hadar

“…In the other direction, we give a simple quasipolynomial-time approximation algorithm for free games, and use it to prove that, assuming the ETH, our 3SAT protocol is essentially optimal. …”
Get full text
Get full text
Get full text

Room allocation with capacity diversity and budget constraints by Li, Yunpeng, Jiang, Yichuan, Wu, Weiwei, Jiang, Jiuchuan, Fan, Hui

“…Second, this paper presents a (c* + 2)/2 + ε-factor approximation algorithm (with ε > 0) for the case in which the capacity of each room does not exceed a constant c*. …”
Get full text
Get full text
Get full text

Cost-aware and distance-constrained Collective Spatial Keyword Query by Chan, Harry Kai-Ho, Liu, Shengxin, Long, Cheng, Wong, Raymond Chi-Wing

“…We develop a suite of two algorithms including an exact algorithm and an approximation algorithm with provable guarantees for the problem. …”
Get full text

Performance evaluation for production systems through queueing models by Shen, Yichi

“…For queueing networks, we propose a unified approximation algorithm based on the properties (i.e., affine structure) of mean queue times in queueing systems. …”
Get full text

Distributed Task Allocation Algorithms for Multi-Agent Systems With Very Low Communication by Akshay Bapat, Bharath Reddy Bora, Jeffrey W. Herrmann, Shapour Azarm, Huan Xu, Michael W. Otte

“…We present two task allocation algorithms that assume communication may not happen, but that benefit whenever communications are successful. (1) The Spatial Division Playbook Algorithm divides task among agents based on an area decomposition. (2) The Traveling Salesman Playbook Algorithm considers mission travel distance by leveraging Christofides&#x2019; 3/2 approximation algorithm. These algorithms have task completion runtime complexity of <inline-formula> <tex-math notation="LaTeX">$O(m \log m)$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$O(m^{3})$ </tex-math></inline-formula>, respectively, where <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> refers to the total number of tasks. …”
Get full text

SWIPT-Assisted Energy Efficiency Optimization in 5G/B5G Cooperative IoT Network by Maliha Amjad, Omer Chughtai, Muhammad Naeem, Waleed Ejaz

“…Moreover, a comparison of the outer approximation algorithm (OAA) and mesh adaptive direct search algorithm (MADS) for non-linear optimization with the exhaustive search algorithm is provided. …”
Get full text

THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND by MARK BRAVERMAN, KONSTANTIN MAKARYCHEV, YURY MAKARYCHEV, ASSAF NAOR

“…By establishing the usefulness of higher-dimensional rounding schemes, this fact has consequences in approximation algorithms. Specifically, it yields the best known polynomial-time approximation algorithm for the Frieze–Kannan Cut Norm problem, a generic and well-studied optimization problem with many applications.…”
Get full text

Subfeature Ensemble-Based Hyperspectral Anomaly Detection Algorithm by Shuo Wang, Wei Feng, Yinghui Quan, Wenxing Bao, Gabriel Dauphin, Lianru Gao, Xian Zhong, Mengdao Xing

“…Second, six methods including the prior-based tensor approximation algorithm (PTA), Reed&#x2013;Xiaoli method, a low-rank and sparse representation method, a low-rank and sparse matrix decomposition-based Mahalanobis distance method, the graph and total variation regularized low-rank representation-based method, and a method based on tensor principal component analysis are applied to detect anomalies on the original HSI, and the method with the best performance is used to obtain an enhanced feature set. …”
Get full text

A mixed-signal oscillatory neural network for scalable analog computations in phase domain by Corentin Delacour, Stefania Carapezzi, Gabriele Boschetto, Madeleine Abernot, Thierry Gil, Nadine Azemard, Aida Todri-Sanial

“…We find that SKONN’s accuracy is as good as the Goemans–Williamson 0.878-approximation algorithm for Max-cut; whereas SKONN’s computation time only grows logarithmically. …”
Get full text

Fundamental limit of network flow attacks by Fu, Xinzhe.

Get full text

Data-driven optimization with behavioral considerations : applications to pricing by Hariss, Rim.

Get full text

From graphs to matrices, and back : new techniques for graph algorithms by Mądry, Aleksander

Get full text

Optimization and network sensitivity analysis for process retrofitting by Guinand, Ernique A. (Ernique Alberto), 1970-

Get full text