Contiguous cake cutting: hardness results and approximation algorithms by Goldberg, PW, Hollender, A, Suksompong, W

Contiguous cake cutting: Hardness results and approximation algorithms by Goldberg, PW, Hollender, A, Suksompong, W

Approximation algorithms and inapproximability of partition functions of spin systems by Yang, K

Subjects: “…Approximation algorithms…”

Efficiency of Wireless Networks : Approximation Algorithms for the Physical Interference Model / by Goussevskaia, Olga, author 522281, Pignolet, Yvonne-Anne, author 522283, Wattenhofer, Roger, author 522284

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem by Zhen Zhang, Jinchuan Zhang, Lingzhi Zhu

“…In this paper, we give an FPT(<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>)-time approximation algorithm for chromatic <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-median. …”
Get full text

Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks by Junosza-Szaniawski Konstanty, Nogalski Dariusz, Rzążewski Paweł

Get full text

Linear Time Local Approximation Algorithm for Maximum Stable Marriage by Zoltán Király

Get full text

A Guaranteed Approximation Algorithm for QoS Anypath Routing in WMNs by Weijun Yang, Xianxian Zeng, Guanyu Lai

Subjects: Get full text

An Approximation Algorithm for Multi-Unit Auctions : Numerical and Subject Experiments by Satoshi Takahashi, Yoichi Izunaga, Naoki Watanabe

“…Takahashi and Shigeno thus proposed a greedy based approximation algorithm (GBA). In a subject experiment there was truly a difference in efficiency rate but no significant difference in seller's revenue between GBA and VCG. …”
Get full text

Inner approximation algorithm for generalized linear multiplicative programming problems by Yingfeng Zhao, Juanjuan Yang

Subjects: Get full text

A new 1.375-approximation algorithm for sorting by transpositions by Luiz Augusto G. Silva, Luis Antonio B. Kowada, Noraí Romeu Rocco, Maria Emília M. T. Walter

Subjects: Get full text

Approximation algorithms for rapid evaluation and optimization of architectural and civil structures by Tseranidis, Stavros

Get full text

Approximation algorithms for capacitated stochastic inventory systems with setup costs by Shi, Cong, Zhang, Huanan, Chao, Xiuli, Levi, Retsef

“…We develop the first approximation algorithm with worst-case performance guarantee for capacitated stochastic periodic-review inventory systems with setup costs. …”
Get full text
Get full text

Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees by Liebenwein, Lucas, Baykal, Cenk, Gilitschenski, Igor, Karaman, Sertac, Rus, Daniela L

Get full text
Get full text
Get full text
Get full text
Get full text

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces by Sidiropoulos, Anastasios, Badoiu, Mihai, Dhamdhere, Kedar, Gupta, Anupam, Indyk, Piotr, Rabinovich, Yuri, Racke, Harald, Ravi, R

“…© 2019 Society for Industrial and Applied Mathematics We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the 2-dimensional plane. …”
Get full text

Conditionally optimal approximation algorithms for the girth of a directed graph by Dalirrooyfard, Mina, Williams, Virginia Vassilevska

“…Fast good quality approximation algorithms for undirected graphs have been known for decades. …”
Get full text

Tight approximation algorithms for bichromatic graph diameter and related problems by Dalirrooyfard, Mina, Williams, Virginia Vassilevska, Vyas, Nikhil, Wein, Nicole

“…We give the first nontrivial approximation algorithms for most of these problems, including time/accuracy trade-off upper and lower bounds. …”
Get full text

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk by Hajiaghayi, MohammadTaghi, Kortsarz, Guy, Salavatipour, Mohammad R.

“…Thefirstnon-trivial approximation algorithm for this problem is due toCharikarand Karagiozova (STOC' 05) whose algorithm has anapproximation guarantee of$\exp(O(\sqrt{\log n\log\log n}))$,when all $\delta_i=1$ and$\exp(O(\sqrt{\log N\log\log N}))$ for the generaldemand case where $N$ isthe sum of all demands. …”
Get full text

Approximation algorithms for low-distortion embeddings into low-dimensional spaces by Sidiropoulos, Anastasios

Get full text

A multiscale approximation algorithm for the cardinality constrained knapsack problem by Krishnan, Bharath Kumar

Get full text