Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths-Reference-Cited by-同舟云学术

Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths

Published:1999 Issue: Volume: Page:16-27
ISSN:0302-9743
Container-title:Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Alon Noga,Arad Uri,Azar Yossi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-48413-4_3

Reference18 articles.

1. Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. 1–10 (1999)

2. Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: 34th IEEE Symposium on Foundations of Computer Science, pp. 32–40 (1993)

3. Alon, N., Kahale, N.: Approximating the independence number via the 0-function. Math. Programming 80, 253–264 (1998)

4. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. In: Proc. of the 33rd IEEE FOCS, pp. 14–23. IEEE, Los Alamitos (1992)

5. Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: Proc. of 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 312–320 (1994)

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

1. Practical parallel hypergraph algorithms;Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2020-02-19

2. Streaming Algorithms for Independent Sets in Sparse Hypergraphs;Algorithmica;2015-08-19

3. Decomposing combinatorial auctions and set packing problems;Journal of the ACM;2013-08

4. Online coloring of hypergraphs;Information Processing Letters;2010-04

5. Streaming Algorithms for Independent Sets;Automata, Languages and Programming;2010