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

Approximating Minimum Cost Connectivity Orientation and Augmentation

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

DOI10.1137/1.9781611973402.122zbMath1422.68143arXiv1307.4164OpenAlexW1893425122MaRDI QIDQ5384084

Mohit Singh, László A. Végh

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.4164


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)





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