Search results for "average stretch"

Found 20 publication records. Showing 20 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman	Approximation Algorithms for Average Stretch Scheduling.	J. Scheduling	2004	DBLP DOI BibTeX RDF	average stretch, approximation algorithms, Scheduling algorithms
2	David Peleg	Spanning Trees with Low Maximum/Average Stretch.	CIAC	2003	DBLP DOI BibTeX RDF
2	S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke	Online Scheduling to Minimize Average Stretch.	FOCS	1999	DBLP DOI BibTeX RDF	scheduling, multiprocessors, online algorithms, competitive analysis
1	Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid	Approximating the Average Stretch Factor of Geometric Graphs.	ISAAC	2010	DBLP DOI BibTeX RDF
1	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	ESA	2009	DBLP DOI BibTeX RDF
1	Aleksej Di Salvo, Guido Proietti	Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Tamar Eilam, Cyril Gavoille, David Peleg	Average stretch analysis of compact routing schemes.	Discrete Applied Mathematics	2007	DBLP DOI BibTeX RDF
1	Michael Dinitz	Compact routing with slack.	PODC	2007	DBLP DOI BibTeX RDF	compact routing, slack
1	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi	On space-stretch trade-offs: lower bounds.	SPAA	2006	DBLP DOI BibTeX RDF	compact routing
1	Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng	Lower-stretch spanning trees.	STOC	2005	DBLP DOI BibTeX RDF	low-distortion embeddings, low-stretch spanning trees, probabilistic tree metrics
1	Doina Bein, Ajoy Kumar Datta, Vincent Villain	Self-Stablizing Pivot Interval Routing in General Networks.	ISPAN	2005	DBLP DOI BibTeX RDF
1	Luca Becchetti, Stefano Leonardi, S. Muthukrishnan	Average stretch without migration.	J. Comput. Syst. Sci.	2004	DBLP DOI BibTeX RDF
1	S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke	Online Scheduling to Minimize Average Stretch.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
1	Aleksej Di Salvo, Guido Proietti	Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.	SIROCCO	2004	DBLP DOI BibTeX RDF
1	Jie Song, Zhonghua Yang, Simon See	Investigating Super Scheduling Algorithms for Grid Computing: A Simulation Approach.	PDCAT	2004	DBLP DOI BibTeX RDF
1	Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer	Scheduling to Minimize Flow Time Metrics.	IPDPS	2003	DBLP DOI BibTeX RDF	scheduling on multiple machines, competitive analysis, On-line algorithms
1	Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs	Semi-clairvoyant Scheduling.	ESA	2003	DBLP DOI BibTeX RDF
1	Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman	Improved algorithms for stretch scheduling.	SODA	2002	DBLP DOI BibTeX RDF
1	Luca Becchetti, Stefano Leonardi, S. Muthukrishnan	Scheduling to minimize average stretch without migration.	SODA	2000	DBLP DOI BibTeX RDF
1	David Peleg, Eilon Reshef	Deterministic Polylog Approximation for Minimum Communication Spanning Trees.	ICALP	1998	DBLP DOI BibTeX RDF