The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is...
5 KB (196 words) - 04:42, 22 May 2024
Shortest path problem (redirect from Shortest path algorithms)
Dimension, Shortest Paths, and Provably Efficient Algorithms". ACM-SIAM Symposium on Discrete Algorithms, pages 782–793, 2010. Abraham, Ittai; Delling, Daniel;...
40 KB (4,020 words) - 09:27, 2 September 2024
and Practical Algorithm for Sparse Fourier Transform" (PDF). ACM-SIAM Symposium on Discrete Algorithms. Archived (PDF) from the original on 2012-03-04....
63 KB (7,383 words) - 11:48, 9 September 2024
published in the Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012. Esteve, Anna; Boj, Eva; Fortiana, Josep (2009), "Interaction...
17 KB (2,363 words) - 16:33, 3 September 2024
branch-and-bound algorithm. There are a few variations to the greedy algorithm: Pure greedy algorithms Orthogonal greedy algorithms Relaxed greedy algorithms Greedy...
16 KB (1,778 words) - 17:37, 3 July 2024
Component (graph theory) (section Algorithms)
Sanjeev (ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013...
30 KB (3,441 words) - 12:55, 5 July 2024
Priority queue (section Discrete event simulation)
Efficient Priority Queues" (PDF), Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58 Goodrich, Michael T.; Tamassia, Roberto (2004)....
32 KB (4,891 words) - 02:34, 8 September 2024
Graph coloring (redirect from Algorithms for graph coloring)
G-colourable graphs", Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1426–1435 Yates, F. (1937), The design and analysis of...
67 KB (7,996 words) - 16:56, 29 August 2024
tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco, California, pp...
44 KB (5,460 words) - 11:42, 17 August 2024
Quasi-polynomial time (category Analysis of algorithms)
Chawla, Shuchi (ed.), Proceedings of the 31st Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020, pp...
11 KB (1,088 words) - 14:14, 29 July 2024
bounds on the complexity of the Boyer–Moore string matching algorithm". Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms. Soda '91...
22 KB (2,769 words) - 09:56, 5 September 2024
sieving." Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms (pp. 10-24). Society for Industrial and Applied Mathematics...
27 KB (3,341 words) - 11:34, 22 August 2024
Exponential Time Algorithms for the Shortest Vector Problem". Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '10. Philadelphia...
28 KB (3,660 words) - 20:46, 21 April 2024
central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix...
38 KB (4,358 words) - 22:33, 24 August 2024
(jointly sponsored by SIGGRAPH), until 2014 SODA: ACM/SIAM Symposium on Discrete Algorithms (jointly sponsored by the Society for Industrial and Applied...
4 KB (398 words) - 13:15, 25 November 2023
Fenghui (2007), "Improved algorithms for path, matching, and packing problems", Proc. 18th ACM-SIAM Symposium on Discrete algorithms (SODA '07) (PDF), pp. 298–307...
22 KB (2,662 words) - 01:59, 2 January 2024
Theoretical computer science (section Algorithms)
Group on Algorithms and Computation Theory (SIGACT) provides the following description: TCS covers a wide variety of topics including algorithms, data...
41 KB (4,794 words) - 11:29, 3 September 2024
Subset sum problem (redirect from Schroeppel and Shamir's algorithm)
N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). SIAM. pp. 1073–1084. arXiv:1610.04712. doi:10...
25 KB (3,783 words) - 14:10, 26 June 2024
the journal also invites selected papers from the ACM-SIAM Symposium on Discrete Algorithms (SODA). The journal is abstracted and indexed in the Science...
3 KB (224 words) - 13:40, 25 July 2023
Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 546–555. Chlebík, Miroslav; Chlebíková, Janka (2008), "The Steiner tree problem on graphs: Inapproximability...
8 KB (1,057 words) - 06:36, 29 April 2024
Directed acyclic graph (category Commons category link is on Wikidata)
acyclic graphs", Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), Philadelphia, PA, USA: Society for Industrial and...
45 KB (5,628 words) - 07:48, 20 May 2024
Independent set (graph theory) (redirect from Approximation algorithms for the maximum independent set problem)
in polynomial time", SODA (Symposium on Discrete Algorithms): 570–581. Luby, Michael (1986), "A simple parallel algorithm for the maximal independent...
30 KB (3,561 words) - 21:44, 4 September 2024
perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals...
62 KB (7,323 words) - 13:37, 6 September 2024
Heap (data structure) (category Commons category link is on Wikidata)
Efficient Priority Queues" (PDF), Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58 Goodrich, Michael T.; Tamassia, Roberto (2004)....
16 KB (2,922 words) - 05:33, 12 August 2024
Maximum subarray problem (redirect from Kadane’s Algorithm)
(1998), "Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication", Proceedings of the 9th Symposium on Discrete Algorithms (SODA): 446–452...
20 KB (2,459 words) - 04:52, 26 August 2024
Bin packing problem (redirect from First fit algorithm)
produced with sophisticated algorithms. In addition, many approximation algorithms exist. For example, the first fit algorithm provides a fast but often...
52 KB (6,986 words) - 20:25, 28 July 2024
Delone set (redirect from Uniformly discrete set)
"Navigating nets: simple algorithms for proximity search", Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '04), Philadelphia...
11 KB (1,243 words) - 04:56, 25 January 2024
Job-shop scheduling (section Johnson's algorithm)
annual ACM-SIAM symposium on Discrete algorithms. Symposium on Discrete Algorithms archive. pp. 463–472. Fleischer, Rudolf (2000). Algorithms – ESA 2000....
19 KB (2,592 words) - 05:13, 21 August 2024
Time complexity (redirect from Fast algorithms)
N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19...
41 KB (4,998 words) - 19:17, 11 August 2024
Suffix array (section Construction algorithms)
(1990). Suffix arrays: a new method for on-line string searches. First Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 319–327. Manber, Udi; Myers, Gene...
30 KB (3,848 words) - 18:07, 29 July 2024