Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • k-Center with Covering Constraints 2022-10-14 Paper A technique for obtaining true approximations for \(k\)-center with covering constraints 2022-03-22 Paper...
    10 bytes (16 words) - 09:44, 7 October 2023
  • allocation by deleting items 2021-04-19 Paper Stable matchings with covering constraints: a complete computational trichotomy 2020-04-01 Paper Correction...
    10 bytes (16 words) - 01:06, 12 December 2023
  • Paper A Technique for Obtaining True Approximations for k-Center with Covering Constraints 2022-10-14 Paper https://portal.mardi4nfdi.de/entity/Q5075740 2022-05-11...
    10 bytes (16 words) - 09:44, 7 October 2023
  • Publication Type Approximation algorithm for vertex cover with multiple covering constraints 2022-02-01 Paper...
    10 bytes (16 words) - 00:08, 25 September 2023
  • 2008-09-18 Paper Minimizing a monotone concave function with laminar covering constraints 2008-09-10 Paper Minimum cost source location problems with flow...
    10 bytes (16 words) - 03:31, 7 October 2023
  • Paper A Technique for Obtaining True Approximations for k-Center with Covering Constraints 2022-10-14 Paper https://portal.mardi4nfdi.de/entity/Q5091238 2022-07-21...
    10 bytes (16 words) - 10:55, 7 October 2023
  • de/entity/Q2934585 2014-12-18 Paper Submodular Function Minimization under Covering Constraints 2014-07-25 Paper Equivalence of convex minimization problems over...
    10 bytes (16 words) - 13:49, 24 September 2023
  • Paper A Technique for Obtaining True Approximations for k-Center with Covering Constraints 2022-10-14 Paper A Framework for the Secretary Problem on the Intersection...
    10 bytes (16 words) - 23:44, 10 December 2023
  • 2022-07-21 Paper Approximation algorithm for vertex cover with multiple covering constraints 2022-02-01 Paper Iterative partial rounding for vertex cover with...
    10 bytes (18 words) - 04:12, 25 September 2023
  • submodular set covering constraints and precedence constraints 2018-06-22 Paper A CHARACTERIZATION OF WEIGHTED POPULAR MATCHINGS UNDER MATROID CONSTRAINTS 2018-05-18...
    10 bytes (16 words) - 02:47, 25 September 2023
  • Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints 2017-05-16 Paper https://portal.mardi4nfdi.de/entity/Q2965490 2017-03-03...
    10 bytes (17 words) - 20:18, 6 October 2023
  • Relatives 2007-11-15 Paper Mixed covering of trees and the augmentation problem with odd diameter constraints 2007-05-29 Paper Covering planar graphs with a fixed...
    10 bytes (16 words) - 00:02, 10 December 2023
  • properties of covering mappings 2009-10-27 Paper Locally covering maps in metric spaces and coincidence points 2009-10-23 Paper Covering mappings and their...
    10 bytes (19 words) - 08:50, 9 December 2023
  • Optimization and Packing-Covering Approximation Algorithms 2015-09-02 Paper A nearly linear-time PTAS for explicit fractional packing and covering linear programs...
    10 bytes (19 words) - 15:51, 10 December 2023
  • Linear Complementarity Constraints 2011-06-24 Paper Strong valid inequalities for orthogonal disjunctions and bilinear covering sets 2010-09-16 Paper The...
    10 bytes (21 words) - 02:07, 11 December 2023
  • Series-Parallel Precedence Constraints: An Algorithm and Extensions 1979-01-01 Paper Sequencing with Series-Parallel Precedence Constraints 1979-01-01 Paper https://portal...
    10 bytes (19 words) - 09:10, 12 December 2023
  • solutions to the maximal expected covering location problem 2003-04-28 Paper Dual-based heuristics for a hierarchical covering location problem 2003-04-28 Paper...
    10 bytes (18 words) - 01:51, 13 December 2023
  • 2010-07-07 Paper Optimal gathering protocols on paths under interference constraints 2009-12-15 Paper \((p,1)\)-total labelling of graphs 2008-01-28 Paper...
    10 bytes (17 words) - 02:10, 12 December 2023
  • 2008-03-05 Paper Mixed covering of trees and the augmentation problem with odd diameter constraints 2007-05-29 Paper Mixed covering of trees and the augmentation...
    10 bytes (16 words) - 16:00, 12 December 2023
  • 2011-11-24 Paper Modeling disjunctive constraints with a logarithmic number of binary variables and constraints 2011-06-17 Paper Hooked on IP 2011-05-20...
    10 bytes (19 words) - 16:36, 6 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)