Pages that link to "Item:Q542051"
From MaRDI portal
The following pages link to Faster min-max resource sharing in theory and practice (Q542051):
Displaying 8 items.
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q2164671) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- Approximate max-min resource sharing for structured concave optimization (Q2719242) (← links)
- Congestion Games with Multi-Dimensional Demands (Q2807005) (← links)
- Algorithm Theory - SWAT 2004 (Q5315383) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q6589742) (← links)