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

scientific article; zbMATH DE number 5485591

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

zbMath1231.68046MaRDI QIDQ5302102

Viswanath Nagarajan, Rohit Khandekar, Nikhil Bansal

Publication date: 5 January 2009


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


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)


Related Items (9)

New approaches to multi-objective optimization ⋮ Approximating directed weighted-degree constrained networks ⋮ A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem ⋮ Approximating Directed Weighted-Degree Constrained Networks ⋮ Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees ⋮ Network Design with Weighted Degree Constraints ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids ⋮ Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal







This page was built for publication:

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