Search results
From MaRDI portal
- for red-blue set cover with unit disks 2022-03-22 Paper On the geometric red-blue set cover problem 2021-10-04 Paper Maximum independent and disjoint coverage...10 bytes (18 words) - 17:16, 24 September 2023
- 2023-10-30 Paper Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs 2020-11-04 Paper Disjoint-Path Facility Location: Theory and Practice...10 bytes (18 words) - 22:08, 10 December 2023
- 2012-01-23 Paper Minimum vertex cover in rectangle graphs 2011-07-20 Paper Approximation of Partial Capacitated Vertex Cover 2011-07-18 Paper Video distribution...10 bytes (16 words) - 07:06, 9 December 2023
- detection algorithms 2022-07-15 Paper Optimized location of light sources to cover a rectangular region 2022-07-15 Paper Symbolic Regression for Approximating...10 bytes (18 words) - 21:17, 9 December 2023
- subgraph problem 2001-10-14 Paper On the complexity of the k-chain subgraph cover problem 1999-01-12 Paper Efficient parallel algorithms for doubly convex-bipartite...10 bytes (18 words) - 08:29, 9 December 2023
- Publication Date of Publication Type Sequence independent lifting of cover inequalities 2022-08-30 Paper Presolve Reductions in Mixed Integer Programming...10 bytes (16 words) - 13:14, 24 September 2023
- Paper Independent transversal total domination versus total domination in trees 2020-12-08 Paper A constructive characterization of vertex cover Roman...10 bytes (18 words) - 03:50, 12 December 2023
- https://portal.mardi4nfdi.de/entity/Q4529518 2002-09-20 Paper The vertex-cover polynomial of a graph 2002-08-29 Paper Structures and chromaticity of extremal...10 bytes (18 words) - 17:52, 9 December 2023
- 2022-08-08 Paper Approximate and exact merging of knapsack constraints with cover inequalities 2021-02-19 Paper The double pivot simplex method 2018-02-09...10 bytes (16 words) - 12:03, 9 December 2023
- random binary matrix 2019-10-14 Paper The cover time of a biased random walk on Gn,p 2019-09-18 Paper On the Cover Time of Dense Graphs 2019-08-29 Paper https://portal...10 bytes (16 words) - 03:27, 10 December 2023
- maximal independent sets of graphs 2019-05-23 Paper A Characterization of Gorenstein Planar graphs 2019-03-11 Paper Regularity of powers of cover ideals...10 bytes (18 words) - 22:00, 9 December 2023
- for connected vertex cover and tree cover 2009-07-21 Paper How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover 2009-03-12 Paper A...10 bytes (16 words) - 19:18, 6 October 2023
- Degree Local Rule Have $O(n^2)$ Cover Time 2018-07-19 Paper Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time 2018-07-16 Paper https://portal...10 bytes (17 words) - 10:01, 8 December 2023
- weak Roman domination 2018-09-17 Paper Algorithms parameterized by vertex cover and modular width, through potential maximal cliques 2018-05-23 Paper Exact...10 bytes (17 words) - 11:54, 11 December 2023
- 2023-11-07 Paper Algorithms for Weighted Independent Transversals and Strong Colouring 2023-10-31 Paper Finding independent transversals efficiently 2021-04-30...10 bytes (19 words) - 13:37, 11 December 2023
- Paper On the monotone likelihood ratio property for the convolution of independent binomial random variables 2010-04-28 Paper The out-of-sample problem for...10 bytes (18 words) - 02:18, 9 December 2023
- domination number of a graph 2022-06-13 Paper Graphs with a unique maximum independent set up to automorphisms 2022-05-27 Paper Graphs that are critical for...10 bytes (17 words) - 23:19, 8 December 2023
- bounded-degree-1 set problem 2018-12-03 Paper Fixed-parameter algorithms for Vertex Cover \(P_3\) 2018-05-24 Paper An \(O^*(1.4366^n)\)-time exact algorithm for maximum...10 bytes (19 words) - 21:31, 8 December 2023
- 2009-06-17 Paper A note on the edge cover number and independence number in hypergraphs 2008-05-13 Paper Independent systems of representatives in weighted...10 bytes (16 words) - 23:39, 9 December 2023
- and its price for the Connected Vertex Cover problem 2020-02-25 Paper Extension of Vertex Cover and Independent Set in some classes of graphs 2020-02-06...10 bytes (18 words) - 02:35, 7 October 2023
