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

Some results on greedy algorithm conjectures

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

DOI10.1016/0166-218X(94)90080-9zbMath0819.90118WikidataQ123165962 ScholiaQ123165962MaRDI QIDQ1331899

T. Cole

Publication date: 29 August 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

greedy networksminimal Steiner networks


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)





Cites Work

  • A variational approach to the Steiner network problem
  • Steiner tree problems
  • Some remarks on the Steiner problem
  • On the Problem of Steiner
  • The Complexity of Computing Steiner Minimal Trees
  • Steiner Minimal Trees




This page was built for publication: Some results on greedy algorithm conjectures

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1331899&oldid=13460041"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki