19 search results - page 1 / 4 » On some monotone path problems in line arrangements |
CCCG
2004
13 years 6 months ago
2004
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We show how to construct an arrangement of n lines having a monotone path of length Ω(n2−(d/ √ log n)), where d > 0 is some constant, and thus nearly settle the long stan...
CCCG
2003
13 years 6 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
MP
2008
13 years 4 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...