Pages that link to "Item:Q3581484"
From MaRDI portal
The following pages link to Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Q3581484):
Displaying 50 items.
- Confronting hardness using a hybrid approach (Q3581485) (← links)
- Measure and conquer (Q3581486) (← links)
- An asymptotic approximation algorithm for 3D-strip packing (Q3581487) (← links)
- Self-improving algorithms (Q3581488) (← links)
- Testing triangle-freeness in general graphs (Q3581490) (← links)
- Testing graph isomorphism (Q3581491) (← links)
- A robust maximum completion time measure for scheduling (Q3581492) (← links)
- Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling (Q3581493) (← links)
- Improved approximation algorithms for broadcast scheduling (Q3581494) (← links)
- Implicit dictionaries with <i>O</i>(1) modifications per update and fast search (Q3581495) (← links)
- Superiority and complexity of the spaced seeds (Q3581496) (← links)
- Solving random satisfiable 3CNF formulas in expected polynomial time (Q3581497) (← links)
- Finding large sticks and potatoes in polygons (Q3581499) (← links)
- Cache-oblivious dynamic programming (Q3581500) (← links)
- A computational study of external-memory BFS algorithms (Q3581501) (← links)
- Tight approximation algorithms for maximum general assignment problems (Q3581502) (← links)
- Approximating the <i>k</i>-multicut problem (Q3581503) (← links)
- 8/7-approximation algorithm for (1,2)-TSP (Q3581504) (← links)
- Approximation algorithms for wavelet transform coding of data streams (Q3581505) (← links)
- Streaming and sublinear approximation of entropy and information distances (Q3581507) (← links)
- FPTAS for mixed-integer polynomial optimization with a fixed number of variables (Q3581508) (← links)
- Weighted isotonic regression under the <i>L</i><sub>1</sub> norm (Q3581509) (← links)
- Oblivious string embeddings and edit distance approximations (Q3581511) (← links)
- Anytime algorithms for multi-armed bandit problems (Q3581512) (← links)
- Randomized online algorithms for minimum metric bipartite matching (Q3581513) (← links)
- Scalable leader election (Q3581515) (← links)
- <i>l</i><sup>2</sup><sub>2</sub> spreading metrics for vertex ordering problems (Q3581516) (← links)
- An improved approximation algorithm for combinatorial auctions with submodular bidders (Q3581517) (← links)
- Matrix approximation and projective clustering via volume sampling (Q3581518) (← links)
- On <i>k</i>-Median clustering in high dimensions (Q3581519) (← links)
- Entropy based nearest neighbor search in high dimensions (Q3581520) (← links)
- Efficient algorithms for substring near neighbor problem (Q3581521) (← links)
- Pattern matching with address errors (Q3581523) (← links)
- A new approach to proving upper bounds for MAX-2-SAT (Q3581524) (← links)
- On nash equilibria for a network creation game (Q3581526) (← links)
- Approximating unique games (Q3581527) (← links)
- A deterministic subexponential algorithm for solving parity games (Q3581528) (← links)
- Combination can be hard (Q3581529) (← links)
- Tightening non-simple paths and cycles on surfaces (Q3581530) (← links)
- Anisotropic surface meshing (Q3581531) (← links)
- Overhang (Q3581532) (← links)
- Lower bounds for asymmetric communication channels and distributed source coding (Q3581533) (← links)
- Constraint solving via fractional edge covers (Q3581534) (← links)
- Efficient construction of unit circular-arc models (Q3581535) (← links)
- Distributed selfish load balancing (Q3581536) (← links)
- Rank/select operations on large alphabets (Q3581537) (← links)
- <i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees (Q3581539) (← links)
- The rainbow skip graph (Q3581540) (← links)
- Asymmetric balanced allocation with simple hash functions (Q3581541) (← links)
- Balanced allocation on graphs (Q3581542) (← links)
