# Computational Network Design from Functional Specifications

arXiv: https://arxiv.org/abs/1510.09203 · HTML: https://mlsanity.com/paper/1510.09203/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Oct 2015.

## Built on by (most cited first, 4 of 4)

- [TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling](https://mlsanity.com/paper/2401.03138/) (2024)
- [Topology-Preserving Downsampling of Binary Images](https://mlsanity.com/paper/2407.17786/) (2024)
- [A Concise Survey on Lane Topology Reasoning for HD Mapping](https://mlsanity.com/paper/2504.01989/) (2025)
- [Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach](https://mlsanity.com/paper/2405.17507/) (2024)

## Abstract (arXiv)

Connectivity and layout of underlying networks largely determine the behavior of many environments. For example, transportation networks determine the flow of traffic in cities, or maps determine the difficulty and flow in games. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from em only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination locations, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all specified hard constraints, and score favorably in terms of the objective function. We evaluate our algorithm in three different design settings (i.e., street layout, floorplanning, and game level design) and demonstrate, for the first time, that diverse networks can emerge purely from high-level functional specifications.