Author image not provided
 Shayan Oveisgharan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.00
Citation Count24
Publication count3
Publication years2007-2009
Available for download2
Average downloads per article394.50
Downloads (cumulative)789
Downloads (12 Months)48
Downloads (6 Weeks)7
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


3 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 3 of 3
Sort by:

1 published by ACM
July 2009 ACM Transactions on Algorithms (TALG): Volume 5 Issue 3, July 2009
Publisher: ACM
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 6,   Downloads (12 Months): 38,   Downloads (Overall): 499

Full text available: PDFPDF
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects (representing anything from a robot swarm or firefighter team to map labels or network messages) to achieve a global property of the ...
Keywords: Euclidean plane, pebble placement, graphs, Motion planning

2
October 2007 Information Processing Letters: Volume 104 Issue 3, October, 2007
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 2

Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree), the weighted degree of a vertex is defined as the sum of the weights of its incident ...
Keywords: Graph algorithms, Spanning trees, Approximation algorithms

3
January 2007 SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 290

Full text available: PDFPDF
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects (representing anything from a robot swarm or firefighter team to map labels or network messages) to achieve a global property of the ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us