Search results for "pseudo approximation"

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

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo approximation algorithms, with applications to optimal motion planning.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	d 1-optimal motion, optimal motion planning, pseudo approximation, approximation algorithms, NP-hard problem, binary search, robot motion planning, Euclidean shortest path
2	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo Approximation Algorithms with Applications to Optimal Motion Planning.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
1	Brian C. Dean, Adam Griffis, Adam A. Whitley	Approximation Algorithms for k-Hurdle Problems.	LATIN	2008	DBLP DOI BibTeX RDF
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	STOC	2006	DBLP DOI BibTeX RDF	edge-separator, single commodity max-flow, sparse cut, spectral method
1	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee	Improved approximation algorithms for minimum-weight vertex separators.	STOC	2005	DBLP DOI BibTeX RDF	vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
1	Joseph Naor	From Balanced Graph Partitioning to Balanced Metric Labeling.	ESA	2005	DBLP DOI BibTeX RDF
1	José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses	On the Inefficiency of Equilibria in Congestion Games.	IPCO	2005	DBLP DOI BibTeX RDF
1	Eyal Amir, Robert Krauthgamer, Satish Rao	Constant factor approximation of vertex-cuts in planar graphs.	STOC	2003	DBLP DOI BibTeX RDF	balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph

Displaying result #1 - #9 of 9 (100 per page; Change: )