Related Experiment Video
Updated: May 2, 2026

Using Informational Connectivity to Measure the Synchronous Emergence of fMRI Multi-voxel Information Across Time
Published on: July 1, 2014
An FPTAS for Connectivity Interdiction
Chien-Chung Huang1, Nidia Obscura Acosta2, Sorrachai Yingchareonthawornchai3
1Department of Computer Science, École Normale Supérieure, Paris, France.
This study provides a fully polynomial-time approximation scheme (FPTAS) for the connectivity interdiction problem. Faster exact and approximation algorithms are also developed for unit edge costs, advancing graph cut research.
Area of Science:
- Graph Theory
- Combinatorial Optimization
- Computer Science
Background:
- The connectivity interdiction problem involves minimizing remaining edge weights after removing edges under a budget.
- This NP-hard problem is a generalization of the knapsack problem.
- Prior work established a polynomial-time approximation scheme (PTAS) and exact algorithms for unit edge costs.
Purpose of the Study:
- To determine if a fully polynomial-time approximation scheme (FPTAS) is achievable for the general connectivity interdiction problem.
- To develop faster exact and approximation algorithms for the special case of unit edge costs.
Main Methods:
- Establishing a connection to a novel intermediate problem: the normalized min-cut.
- The normalized min-cut problem penalizes remaining edge weights based on the number of edges removed for free.
Main Results:
- An affirmative answer to the existence of an FPTAS for the general connectivity interdiction problem.
- Development of improved exact and approximation algorithms for the unit edge cost variant.
Conclusions:
- The FPTAS for the connectivity interdiction problem is now established.
- The normalized min-cut provides a key technical advancement for solving related graph cut problems.
More Related Videos
09:36Continuous-Wave Propagation Channel-Sounding Measurement System - Testing, Verification, and Measurements
Published on: June 25, 2021
07:49Automated Deployment of an Internet Protocol Telephony Service on Unmanned Aerial Vehicles Using Network Functions Virtualization
Published on: November 26, 2019
Related Concept Videos
Thevinin's Theorem
Interference: Path Lengths
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
Reclosers and Fuses
A comprehensive protection scheme for radial distribution...
Transmission Line Design Considerations
Social Traps
Circuit Breaker and Fuse Selection
In high-voltage systems,...