Sciweavers

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

12

GD
2008
Springer

favoriteEmaildiscussreport

92views Computer Graphics» more GD 2008»

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

13 years 5 months ago

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Download www.math.ntua.gr

Evmorfia N. Argyriou, Michael A. Bekos, Michael Ka

Real-time Traffic

Computer Graphics | GD 2008 |

claim paper

Related Content

» A PolynomialTime Algorithm for the Matching of Crossing ContactMap Patterns

» Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

» A polynomial algorithm for lotsize scheduling of two type tasks

» NonGaussian statistical timing analysis using secondorder polynomial fitting

» An Efficient Algorithm for Minimizing a Sum of pNorms

» An Efficient Graph Cut Algorithm for Computer Vision Problems

» Efficiently Learning Mixtures of Two Gaussians

» CrossDomain Approximate String Matching

» Scheduling two parallel machines with a single server the general case

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2008
Where	GD
Authors	Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis

Comments (0)