Fully-dynamic graph sparsifiers against an adaptive adversary
Designing dynamic graph algorithms against an adaptive adversary is a major goal in the
field of dynamic graph algorithms. While a few such algorithms are known for spanning …
field of dynamic graph algorithms. While a few such algorithms are known for spanning …
Term grouping and travelling salesperson for digital quantum simulation
Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is
the initially proposed application of quantum computing. The large number of quantum gates …
the initially proposed application of quantum computing. The large number of quantum gates …
Chasing positive bodies
We study the problem of chasing positive bodies in 1: given a sequence of bodies
K_t=\left{x^t∈R_+^n∣C^tx^t≧1,P^tx^t≦1\right\} revealed online, where C^t and P^t are …
K_t=\left{x^t∈R_+^n∣C^tx^t≧1,P^tx^t≦1\right\} revealed online, where C^t and P^t are …
Approximating the held-karp bound for metric TSP in nearly-linear time
We give a nearly linear-time randomized approximation scheme for the Held-Karp bound
[22] for Metric-TSP. Formally, given an undirected edge-weighted graph G=(V, ε) on m edges …
[22] for Metric-TSP. Formally, given an undirected edge-weighted graph G=(V, ε) on m edges …
Approximating k-edge-connected spanning subgraphs via a near-linear time LP solver
P Chalermsook, CC Huang, D Nanongkai… - arXiv preprint arXiv …, 2022 - arxiv.org
In the $ k $-edge-connected spanning subgraph ($ k $ ECSS) problem, our goal is to
compute a minimum-cost sub-network that is resilient against up to $ k $ link failures: Given …
compute a minimum-cost sub-network that is resilient against up to $ k $ link failures: Given …
Sublinear algorithms and lower bounds for metric tsp cost estimation
We consider the problem of designing sublinear time algorithms for estimating the cost of a
minimum metric traveling salesman (TSP) tour. Specifically, given access to a $ n\times n …
minimum metric traveling salesman (TSP) tour. Specifically, given access to a $ n\times n …
Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics
We consider the design of sublinear space and query complexity algorithms for estimating
the cost of a minimum spanning tree (MST) and the cost of a minimum traveling salesman …
the cost of a minimum spanning tree (MST) and the cost of a minimum traveling salesman …
Finding the shortest path with vertex constraint over large graphs
Graph is an important complex network model to describe the relationship among various
entities in real applications, including knowledge graph, social network, and traffic network …
entities in real applications, including knowledge graph, social network, and traffic network …
Fast and Deterministic Approximations for -Cut
K Quanrud - arXiv preprint arXiv:1807.07143, 2018 - arxiv.org
In an undirected graph, a $ k $-cut is a set of edges whose removal breaks the graph into at
least $ k $ connected components. The minimum weight $ k $-cut can be computed in $ O …
least $ k $ connected components. The minimum weight $ k $-cut can be computed in $ O …
[PDF][PDF] Solving travelling salesman problem using an improved ant colony optimization algorithm
KI Rufai, OL Usman, OO Olusanya… - University of Ibadan …, 2021 - journals.ui.edu.ng
University of Ibadan Solving Travelling Salesman Problem Using an Improved Ant Colony
Optimization Algorithm Page 1 158 UIJSLICTR Vol. 6 No. 2 June, 2021 ISSN: 2714-3627 …
Optimization Algorithm Page 1 158 UIJSLICTR Vol. 6 No. 2 June, 2021 ISSN: 2714-3627 …