A network partitioning methodology for distributed traffic management applications
Authors:
- Hamideh EtemadniaHEHamideh Etemadnia
- Khaled AbdelghanyKAKhaled Abdelghany
- Ahmed HassanAHAhmed Hassan
- 14 June 2013
- journal article
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- Vol. 10 (6) , 518-532
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Urban gridlock: Macroscopic modeling and mitigation approachesTransportation Research Part B: Methodological, 2007
- A multi-agent architecture for cooperative inter-jurisdictional traffic congestion managementTransportation Research Part C: Emerging Technologies, 2002
- Multiagent architectures for intelligent traffic management systemsTransportation Research Part C: Emerging Technologies, 2002
- Hybrid Real-Time Dynamic Traffic Assignment Approach for Robust Network PerformanceTransportation Research Record: Journal of the Transportation Research Board, 2002
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Knowledge-based models for adaptive traffic management systemsTransportation Research Part C: Emerging Technologies, 1995
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Sparsest cuts and bottlenecks in graphsDiscrete Applied Mathematics, 1990
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982