Sciweavers

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

30

ENC
2006
IEEE

favoriteEmaildiscussreport

79views Theoretical Computer Science» more ENC 2006»

Complexity of the Mixed Postman Problem with Restrictions on the Edges

14 years 5 months ago

Complexity of the Mixed Postman Problem with Restrictions on the Edges

Download ce.azc.uam.mx

Francisco Javier Zaragoza Martínez

Real-time Traffic

ENC 2006 |

claim paper

Related Content

» Feasibility of the Mixed Postman Problem with Restrictions on the Edges

» A comparison of two different formulations for arc routing problems on mixed graphs

» The Windy General Routing Polyhedron A Global View of Many Known Arc Routing Polyhedra

» Complexity dichotomy on degreeconstrained VLSI layouts with unitlength edges

» On the computational complexity of strong edge coloring

» The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

» On Approximating Restricted Cycle Covers

» Grid Graph Reachability Problems

» The Computational Complexity of the Minimum Weight Processor Assignment Problem

Post Info
More Details (n/a)

Added	11 Jun 2010
Updated	11 Jun 2010
Type	Conference
Year	2006
Where	ENC
Authors	Francisco Javier Zaragoza Martínez

Comments (0)