-
Chapter and Conference Paper
Design and Application of Optimal Path Service System on Multi-level Road Network
Classical algorithms of optimal path analysis are not efficient enough when handling large numbers of road network nodes. With the light of web service and internet, this problem has a breakthrough development...
-
Article
Bone Mineral Density and Elemental Composition of Bone Tissues in “Red-Boned” Guishan Goats
Red-colored bones were first found in Guishan goats in the 1980s, and they were subsequently designated red-boned Guishan goats. However, the difference remains unclear between the bone mineral density (BMD) o...
-
Chapter and Conference Paper
An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
We present a unified semidefinite programming hierarchies rounding approximation algorithm for a class of maximum graph bisection problems with improved approximation ratios.
-
Article
An Approximation Algorithm for the Stochastic Fault-Tolerant Facility Location Problem
In this paper, we study a stochastic version of the fault-tolerant facility location problem. By exploiting the stochastic structure, we propose a 5-approximation algorithm which uses the LP-rounding technique...
-
Chapter and Conference Paper
Erratum: Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
The authors’ correct affiliations of this paper should be as follows:
-
Chapter and Conference Paper
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
In this paper, we consider the balanced Max-3-Uncut problem which has several applications in the design of VLSI circuits. We propose a complex discrete linear program for the balanced Max-3-Uncut problem. App...
-
Chapter and Conference Paper
Erratum: A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
The authors’ correct affiliations of this paper should be as follows:
-
Chapter and Conference Paper
Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
In this paper, we introduce two variants of the submodular vertex cover problem, namely, the submodular vertex cover problems with linear and submodular penalties, for which we present two primal-dual approxim...
-
Chapter and Conference Paper
An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem
In this paper, we introduce a model of distributionally robust facility location problem (DRFLP) under moment constraints up to the second order. We show, via duality theory of moment problems, that the linear...
-
Article
An improved per-scenario bound for the two-stage stochastic facility location problem
We study the two-stage stochastic facility location problem (2-SFLP) by proposing an LP (location problem)-rounding approximation algorithm with 2.3613 per-scenario bound for this problem, improving the previousl...
-
Chapter and Conference Paper
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
We consider two multilevel facility location problems with linear and submodular penalties respectively, and propose two approximation algorithms with performance guarantee
-
Chapter and Conference Paper
Approximation Algorithms for the Robust Facility Location Problem with Penalties
In this paper, we consider the robust facility location problem with penalties, aiming to serve only a specified fraction of the clients. We formulate this problem as an integer linear programming to identify ...
-
Chapter and Conference Paper
A \((5.83+\epsilon )\) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
In the universal facility location problem, we are given a set of clients and facilities. Our goal is to find an assignment such that the total connection and facility cost is minimized. The connection cost is...
-
Article
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
We present a unified semidefinite programming hierarchies rounding approximation algorithm for a class of maximum graph bisection problems with improved approximation ratios. Under the above algorithmic framew...
-
Chapter and Conference Paper
Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties
We present two local search algorithms for the k-median and k-facility location problems with linear penalties (k-MLP and k-FLPLP), two extensions of the classical k-median and k-facility location problems respec...
-
Article
Open AccessHematological and histopathological effects of swainsonine in mouse
Livestock that consume locoweed exhibit multiple neurological symptoms, including dispirited behavior, staggered gait, trembling, ataxia, impaired reproductive function and cellular vacuolar degeneration of mu...
-
Article
Approximation algorithms for the priority facility location problem with penalties
This paper considers the priority facility location problem with penalties. The authors develop a primal-dual 3-approximation algorithm for this problem. Combining with the greedy augmentation procedure, the a...
-
Chapter and Conference Paper
An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
We present a \((1+ \sqrt{3} + \epsilon )\) -approximation algorithm for the k-median problem with uniform pe...
-
Chapter and Conference Paper
Approximation and Hardness Results for the Max k-Uncut Problem
In this paper, we propose the \(\mathsf{Max}~k\text {-}\mathsf{Uncut}\) problem. Given an n-vertex undirect...
-
Article
Combinatorial approximation algorithms for the robust facility location problem with penalties
In this paper, we consider the robust facility location problem with penalties, aiming to serve only a specified fraction of the clients. We formulate this problem as an integer linear program to identify whic...
