DeepAI AI Chat
Log In Sign Up

Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule

by   Bo Li, et al.

Given a connected graph on whose edges we can build roads to connect the nodes, a number of agents hold possibly different perspectives on which edges should be selected by assigning different edge weights. Our task is to build a minimum number of roads so that every agent has a spanning tree in the built subgraph whose weight is the same as a minimum spanning tree in the original graph. We first show that this problem is NP-hard and does not admit better than ((1-o(1))ln k)-approximation polynomial-time algorithms unless P=NP, where k is the number of agents. We then give a simple voting algorithm with an optimal approximation ratio. Moreover, our algorithm only needs to access the agents' rankings on the edges. Finally, we extend our results to submodular objective functions and Matroid rank constraints.


page 1

page 2

page 3

page 4


A 4/3 Approximation for 2-Vertex-Connectivity

The 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the mo...

On the Complexity of the Bilevel Minimum Spanning Tree Problem

We consider the bilevel minimum spanning tree (BMST) problem where the l...

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

In the k-edge-connected spanning subgraph (kECSS) problem, our goal is t...

Fast and Reliable Dispersal of Crash-Prone Agents on Graphs

We study the ability of mobile agents performing simple local computatio...

On Optimal Coverage of a Tree with Multiple Robots

We study the algorithmic problem of optimally covering a tree with k mob...

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty

In this paper we study how to optimally balance cheap inflexible resourc...

Maximizing the Number of Spanning Trees in a Connected Graph

We study the problem of maximizing the number of spanning trees in a con...