Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

56

CORR
2010
Springer

51views Education» more CORR 2010»

Prize-collecting Network Design on Planar Graphs

15 years 3 months ago

Prize-collecting Network Design on Planar Graphs

Download www-math.mit.edu

MohammadHossein Bateni, MohammadTaghi Hajiaghayi,

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Reduction tests for the prizecollecting Steiner problem

» Strong Lower Bounds for a Survivable Network Design Problem

» Finegrained locationfree planarization in wireless sensor networks

» Convex drawings of hierarchical planar graphs and clustered planar graphs

» Void Traversal for Guaranteed Delivery in Geometric Routing

» Oblivious BuyatBulk in Planar Graphs

» Approximation Schemes for Minimum 2Connected Spanning Subgraphs in Weighted Planar Graphs

» Localized construction of bounded degree and planar spanner for wireless ad hoc networks

» On Open RectangleofInfluence Drawings of Planar Graphs

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx

Comments (0)