Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase minimum gossip time problem (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1994 (1) 2003 (1)
Publication types (Num. hits)
inproceedings(2)
Venues (Conferences, Journals, ...)
FOCS(1) SPAA(1)
Authors
Dongdong Ge(1) Esther M. Arkin(1) Michael A. Bender(1) R. Ravi(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 10 keywords
Results
Found 2 publication records. Showing 2 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Esther M. Arkin, Michael A. Bender, Dongdong Ge Improved approximation algorithms for the freeze-tag problem. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF freeze-tag problem, minimum broadcast-time problem, minimum gossip time problem, multicast problem, scheduling, approximation algorithms, NP-hardness, TSP, data dissemination, swarm robotics, network optimization
1R. Ravi Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF minimum gossip time problem, rapid rumor ramification, minimum broadcast time approximation, minimum broadcast time problem, telephone model, multicast problem, NP-complete, NP-hard, undirected graph, conference calls
Displaying result #1 - #2 of 2 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.