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:2753740
Jump to:navigation, search

zbMath0976.05061MaRDI QIDQ2753740

Zeev Nutov, Guy Kortsarz

Publication date: 11 November 2001


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


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)


Related Items

Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ Tight approximation algorithm for connectivity augmentation problems ⋮ Minimum Cost Globally Rigid Subgraphs ⋮ A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms ⋮ Power assignment for \(k\)-connectivity in wireless ad hoc networks ⋮ Approximating Steiner Networks with Node Weights ⋮ Fast exact algorithms for survivable network design with uniform requirements



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2753740&oldid=15628724"
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 15:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki