๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on a Maximum k-Subset Intersection problem

โœ Scribed by Eduardo C. Xavier

Book ID
113663351
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
105 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on a maximum distance problem
A note on a maximum distance problem
โœ L.G. Proll; A. Salhi ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 348 KB
[Lecture Notes in Computer Science] Comb
[Lecture Notes in Computer Science] Combinatorial Optimization Volume 8596 || An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
โœ Fouilhoux, Pierre; Gouveia, Luis Eduardo Neves; Mahjoub, A. Ridha; Paschos, Vang ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Springer International Publishing ๐ŸŒ German โš– 251 KB

This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014. The 37 revised full papers presented together with 64 short papers were carefully reviewed and selected fr

A note on k-shortest paths problem
A note on k-shortest paths problem
โœ Nick Gravin; Ning Chen ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 66 KB ๐Ÿ‘ 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path