Back to Results
First PageMeta Content
NP-complete problems / Hamiltonian path / Vertex cover / Independent set / Matching / Minimum spanning tree / Dominating set / Graph coloring / Theoretical computer science / Graph theory / Mathematics


CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†
Add to Reading List

Document Date: 2011-08-06 04:11:16

Open Document

File Size: 392,94 KB

Share Result on Facebook

City

Tehran / /

Company

SIAM Journal / /

Country

Iran / /

/

Facility

University of California Berkeley / Sharif University of Technology / /

IndustryTerm

polynomial algorithm / parameter tractable algorithms / inner product / approximation algorithm / bilinear operator / polynomial time algorithm / travel distance / factor approximation algorithm / optimum solution / approximation algorithms / energy / /

Organization

Computer Science Division / University of California / In Proceedings / Sharif University of Technology / Institute for Research / ACM Transactions on Algorithms / Minimizing Movement / Department of Computer Engineering / /

Person

Euclidean Plane / Mohammad Ghodsi / Nima Anari / /

Position

author / Prime Minister / /

PublishedMedium

SIAM Journal on Computing / /

Technology

polynomial time algorithm / approximation algorithm / parameter tractable algorithms / approximation algorithms / factor approximation algorithm / polynomial algorithm / 2011 Algorithm / /

SocialTag