Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the union of intermediate nodes of shortest paths

From MaRDI portal
Publication:358654
Jump to:navigation, search

DOI10.1007/s10878-011-9436-9zbMath1275.90117OpenAlexW1986192370MaRDI QIDQ358654

Xiang Li, Won Jun Lee, Xiao-Dong Hu

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9436-9

zbMATH Keywords

Greedy approximationintersection of shortest paths


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)




Cites Work

  • A Greedy Heuristic for the Set-Covering Problem
  • EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:358654&oldid=12233827"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki