Pages that link to "Item:Q1286472"
From MaRDI portal
The following pages link to On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472):
Displayed 6 items.
- Guarding galleries and terrains (Q845875) (← links)
- Fitting a \(C^m\)-smooth function to data. II (Q1017345) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)