Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams

Suzuki, Hirofumi; Ishihata, Masakazu; Minato, Shin-ichi

doi:10.1007/978-3-030-39881-1_23

Cited by 5 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We collected 45 graphs, which are sparse with at most a few thousand edges, from communication networks (TopologyZoo † † [34], RocketFuel † † † [35], SNDlib † † † † , and JPN48 † † † † † ) and software engineering domains (Rome † † † † † † ). These graphs have been used in recent studies of GC algorithms [36,37]. The 45 graphs were associated with each benchmark, resulting in 45 benchmarks.…”

Section: Benchmark Selection and Statisticsmentioning

confidence: 99%

International Competition on Graph Counting Algorithms 2023

INOUE,

YASUDA,

NABESHIMA

et al. 2024

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfying specified constraints on a given graph. The problem belongs to #P-complete, a computationally tough class. Since many essential systems in modern society, e.g., infrastructure networks, are often represented as graphs, graph counting algorithms are a key technology to efficiently scan all the subgraphs representing the feasible states of the system. In the ICGCA, contestants were asked to count the paths on a graph under a length constraint. The benchmark set included 150 challenging instances, emphasizing graphs resembling infrastructure networks. Eleven solvers were submitted and ranked by the number of benchmarks correctly solved within a time limit. The winning solver, TLDC, was designed based on three fundamental approaches: backtracking search, dynamic programming, and model counting or #SAT (a counting version of Boolean satisfiability). Detailed analyses show that each approach has its own strengths, and one approach is unlikely to dominate the others. The codes and papers of the participating solvers are available: https://afsa.jp/icgca/.

show abstract

Section: Benchmark Selection and Statisticsmentioning

confidence: 99%

International Competition on Graph Counting Algorithms 2023

INOUE,

YASUDA,

NABESHIMA

et al. 2024

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

show abstract

“…Agrawal and Ravi [32] proposed a logarithmic factor approximation algorithm to solve the GSP-EC and later Jain [33] proposed a factor-2 approximation algorithm for the same problem, applying the primal-dual approach for linear programming. Suzuki et al [34] ennumerated optimal GSP solutions applying the Zero-Suppressed Binary Decision Diagrams compact data structure. The proposed method worked correctly for a number of realistic problem instances.…”

Section: Related Workmentioning

confidence: 99%

Reliability Analysis of Survivable Networks under the Hostile Model

2022

View full text Add to dashboard Cite

This article studies the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability and introduces a metaheuristic resolution approach based on Greedy Randomized Adaptive Search Procedure and Variable Neighborhood Descent. Under the hostile model, nodes and links are subject to probabilistic failures. The research focuses on studying the relationship between the optimization and the reliability evaluation in a symmetric network design problem. Relevant research questions are addressed, linking the number of feasible networks for the full probabilistic model, the sensitivity with respect to elementary probabilities of operation for both edges and nodes, and the sensitivity of the model with respect to the symmetric connectivity constraints defined for terminal nodes. The main result indicates that, for the hostile model, it is better at improving the elementary probabilities of operation of links than improving the elementary probabilities of Steiner nodes, to meet a required reliability threshold for the designed network.

show abstract