On a theorem of lovász on covers inr-partite hypergraphs-Reference-Cited by-同舟云学术

On a theorem of lovász on covers inr-partite hypergraphs

Published:1996-06 Issue:2 Volume:16 Page:149-174
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Aharoni Ron,Holzman Ron,Krivelevich Michael

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF01844843.pdf

Reference7 articles.

1. Z. Füredi: Matchings and covers in hypergraphs,Graphs and Combinatorics,4 (1988), 115–206.

2. M. Krivelevich: Approximate set covering in uniform hypergraphs, preprint.

3. L. Lovász: On the ratio of optimal integral and fractional covers,Discrete Math.,13 (1975), 383–390.

4. L. Lovász: On minimax theorems of combinatorics, Doctoral Thesis,Mathematikai Lapok,26 (1975), 209–264. (in Hungarian)

5. L. Lovász: Covers, packings and some heuristic algorithms, in:5th British Comb. Conf., Congressus Numerantium 15 Utilitas Math., Winnipeg, 1976, 417–429.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solution of discrete time–cost trade-off problem with adaptive search domain;Engineering, Construction and Architectural Management;2023-09-08

2. Approximating the discrete time-cost tradeoff problem with bounded depth;Mathematical Programming;2022-02-11

3. Hypergraph Representation via Axis-Aligned Point-Subspace Cover;WALCOM: Algorithms and Computation;2022

4. Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth;Integer Programming and Combinatorial Optimization;2021

5. Approximation Algorithms for Hitting Subgraphs;Lecture Notes in Computer Science;2021