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

scientific article

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

zbMath1002.90047MaRDI QIDQ2768267

Ramesh Hariharan, Ely Porat, Richard John Cole, Moshe Lewenstein

Publication date: 20 January 2003


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generalized Steiner treestravelling Salesman


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)


Related Items (5)

Primal-dual approximation algorithms for the prize-collecting Steiner tree problem ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem ⋮ On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints






This page was built for publication:

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