Search all the public and authenticated articles in CiteULike.
Enter a search phrase. You can also specify

a CiteULike article id (123456),

a DOI (doi:10.1234/12345678)

or a PubMed Id (pmid:12345678).

Click Help for advanced usage.

AbnerCYH's Hochbaum:D [1 article] Export Sort

Recent papers posted to AbnerCYH's library by the author Hochbaum:D. You can also see everyone's Hochbaum:D.

Hide details

Approximation Algorithms for Np-Hard Problems

(26 July 1996)

by Pws P. Co

edited by Dorit Hochbaum

posted to algorithms complexity optimization by AbnerCYH on 2009-05-07 20:00:50 as

along with 1 person BarrosH

Note: You may cite this page as: http://www.citeulike.org/user/AbnerCYH/author/Hochbaum:D

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

algorithms	687
graph	478
complexity	189
combinatorics	150
kdd	128
biology	128
math	127
complex	125
stochastic	113
topology	82
optimization	63
geometries	62
order	61
algebra	56
data_structure	52
dynamics	43
parameterized	38
testing	32
information	28
logic	27
automata	22
game	19
parallel	18
distributed	15
economic	14
sys_performance	14
string	7
neuro	6
history	4

AbnerCYH's Hochbaum:D [1 article] Export Sort

AbnerCYH's tags