The following pages link to (Q3574266):
Displaying 12 items.
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Quickest path queries on transportation network (Q2249042) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- (Q5092347) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)
