The following pages link to Renato F. Werneck (Q519100):
Displaying 41 items.
- Fast local search for the maximum independent set problem (Q519101) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- A hybrid heuristic for the \(p\)-median problem (Q1826490) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- A fast swap-based local search procedure for location problems (Q2480210) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- (Q2741494) (← links)
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs (Q2884534) (← links)
- Hierarchical Hub Labelings for Shortest Paths (Q2912823) (← links)
- Better Bounds for Graph Bisection (Q2912858) (← links)
- Robust Distance Queries on Massive Networks (Q2921417) (← links)
- (Q2921745) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- Maximum Flows by Incremental Breadth-First Search (Q3092252) (← links)
- Highway Dimension and Provably Efficient Shortest Path Algorithms (Q3177817) (← links)
- Data structures for mergeable trees (Q3188996) (← links)
- Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search (Q3452823) (← links)
- (Q3574264) (← links)
- Design of data structures for mergeable trees (Q3581569) (← links)
- Virtual Ring Routing Trends (Q3646239) (← links)
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632) (← links)
- (Q4707782) (← links)
- Alternative routes in road networks (Q5178735) (← links)
- Reach for <i>A</i>*: Efficient Point-to-Point Shortest Path Algorithms (Q5233470) (← links)
- Shortest Path Feasibility Algorithms: An Experimental Evaluation (Q5233514) (← links)
- An Experimental Study of Minimum Mean Cycle Algorithms (Q5233557) (← links)
- Fast Local Search for Steiner Trees in Graphs (Q5233588) (← links)
- Exact Combinatorial Branch-and-Bound for Graph Bisection (Q5233715) (← links)
- Round-Based Public Transit Routing (Q5233725) (← links)
- Robust Mobile Route Planning with Limited Connectivity (Q5233727) (← links)
- Finding Dominators in Practice (Q5301382) (← links)
- Shortest-path feasibility algorithms (Q5406208) (← links)
- Dynamic trees in practice (Q5406221) (← links)
- Fast local search for the steiner problem in graphs (Q5406267) (← links)
- (Q5417667) (← links)
- Finding minimum congestion spanning trees (Q5463408) (← links)
- Algorithms – ESA 2004 (Q5464626) (← links)
- Integer Programming and Combinatorial Optimization (Q5712447) (← links)
- Computing multimodal journeys in practice (Q6534371) (← links)
