Publication

On the Complexity of the Asymmetric VPN Problem

Thomas Rothvoss, Laura Sanità
2009
Conference Papers

Abstract

We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (VPN) problem with arbitrary concave costs. We even show the stronger result, that there is always a tree solution of cost at most 2 OPT and that a tree solution of (expected) cost at most 49.84 OPT can be determined in polynomial time. Furthermore, we answer an outstanding open question about the complexity status of the so called balanced VPN problem by proving its NP-hardness.

Official source

https://infoscience.epfl.ch/entities/publication/1b82ea06-79de-42f2-8eb9-48e464cf6947

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Complexity of the Asymmetric VPN Problem

Chat with Graph Search

Succinct ordering and aggregation constraints in algebraic array theories

Separations in Proof Complexity and TFNP

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems