Traffic-light scheduling on the grid
DOI10.1016/0166-218X(94)90186-4zbMATH Open0810.90036OpenAlexW2031060074WikidataQ127674318 ScholiaQ127674318MaRDI QIDQ1339892FDOQ1339892
Authors: Guy Kortsarz, David Peleg 
Publication date: 11 December 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)90186-4
Recommendations
- scientific article; zbMATH DE number 871903
- Modeling and optimizing traffic light settings in road networks
- On- and offline scheduling of bidirectional traffic
- A cost-efficient scheduling algorithm for traffic grooming
- scientific article; zbMATH DE number 1057928
- scientific article; zbMATH DE number 1149870
- A linear programming approach for adaptive synchronization of traffic signals
- Algorithms for the solution of the combined traffic signal optimisation and equilibrium assignment problem
- Scheduling bidirectional traffic on a path
Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)
Cites Work
Cited In (9)
- Periodic gossiping in back-to-back trees
- Lower bounds on systolic gossip
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Rectangular vs. triangular minimal routing and performance study
- Computing the Optimal Longest Queue Length in Torus Networks
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- Near-optimal scheduling of distributed algorithms
- Sum-of-squares lower bounds for densest \(k\)-subgraph
- Title not available (Why is that?)
This page was built for publication: Traffic-light scheduling on the grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339892)
