Search results
From MaRDI portal
- Approximation Algorithms for Densest k-Subgraph 2013-04-12 Paper Fast algorithms for min independent dominating set 2013-03-12 Paper Algorithms for dominating...10 bytes (16 words) - 12:40, 28 January 2024
- Paper Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences 2020-10-12 Paper Approximation Algorithms for Dynamic Assortment...10 bytes (17 words) - 08:55, 6 October 2023
- Type Improved online algorithms for buffer management in QoS switches 2018-11-05 Paper Preemptive online scheduling: Optimal algorithms for all speeds 2009-05-06...10 bytes (16 words) - 08:34, 7 October 2023
- 2018-09-17 Paper Exact exponential algorithms to find tropical connected sets of minimum size 2017-05-11 Paper Faster Algorithms to Enumerate Hypergraph Transversals...10 bytes (16 words) - 02:52, 7 October 2023
- https://portal.mardi4nfdi.de/entity/Q3579451 2010-08-06 Paper Algorithms - ESA 2003 2010-03-03 Paper Algorithms for Secretary Problems on Graphs and Hypergraphs 2009-07-14...10 bytes (17 words) - 08:19, 7 October 2023
- the complexity of and algorithms for min-max target coverage on a line boundary 2019-10-15 Paper Efficient approximation algorithms for maximum coverage...10 bytes (16 words) - 06:02, 7 October 2023
- parameter landscape of the compact genetic algorithm 2021-04-08 Paper Memetic algorithms outperform evolutionary algorithms in multimodal optimisation 2020-11-16...10 bytes (16 words) - 07:27, 7 October 2023
- 2016-07-08 Paper Online algorithms for scheduling two parallel machines with a single server 2016-05-18 Paper Improved Algorithms for Online Scheduling of...10 bytes (16 words) - 09:11, 7 October 2023
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion 2015-01-21 Paper Efficient algorithms for the longest common subsequence...10 bytes (18 words) - 06:01, 7 October 2023
- parameterized algorithms for minor containment 2011-12-07 Paper Efficient Algorithms for Eulerian Extension 2010-11-16 Paper Efficient exact algorithms on planar...10 bytes (16 words) - 03:35, 7 October 2023
- of order-preserving algorithms for transient first-order systems with controllable numerical dissipation 2012-07-02 Paper Algorithms by Design: Part II—A...10 bytes (18 words) - 03:21, 7 October 2023
- and Combinatorial Optimization. Algorithms and Techniques 2005-08-25 Paper Algorithms – ESA 2004 2005-08-18 Paper Algorithms for Data Migration with Cloning...10 bytes (19 words) - 14:08, 24 September 2023
- deductive synthesis of sorting algorithms in \textit{Theorema} 2022-03-31 Paper Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets...10 bytes (16 words) - 06:11, 7 October 2023
- covering and packing, etc.) 05C85: Graph algorithms (graph-theoretic aspects) 68W27: Online algorithms; streaming algorithms...15 bytes (103 words) - 15:13, 2 May 2024
- 68W25: Approximation algorithms 68W20: Randomized algorithms 91B68: Matching models 68W27: Online algorithms; streaming algorithms Uses Software MapReduce...15 bytes (112 words) - 14:45, 2 May 2024
- Analysis of algorithms 68W05: Nonnumerical algorithms 68R10: Graph theory (including graph drawing) in computer science 05C85: Graph algorithms (graph-theoretic...15 bytes (96 words) - 15:45, 2 May 2024
- randomized algorithms; string algorithms; streaming algorithms; wildcards Mathematics Subject Classification ID 68W20: Randomized algorithms 68W27: Online...15 bytes (78 words) - 14:42, 2 May 2024
- zbMATH Keywords distributed algorithms; dynamic algorithms Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 68R10:...15 bytes (76 words) - 16:06, 2 May 2024
- Mathematics Subject Classification ID 68W40: Analysis of algorithms 68W27: Online algorithms; streaming algorithms...15 bytes (56 words) - 15:58, 2 May 2024
- exponential time algorithms Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 68W40: Analysis of algorithms 68W05: Nonnumerical...15 bytes (110 words) - 16:13, 2 May 2024
