NeilInCanadia's approximation [28 articles] Export

Recent papers added to NeilInCanadia's library classified by the tag approximation. You can also see everyone's approximation.

Hide details

	Primal–Dual Algorithms for Connected Facility Location Problems [My Copy] Algorithmica, Vol. 40, No. 4. (1 December 2004), pp. 245-269. by Chaitanya Swamy, Amit Kumar posted to approximation network_design rent_or_buy by NeilInCanadia on 2009-07-07 20:43:32 as
	Are stable instances easy? [My Copy] (17 Jun 2009) by Yonatan Bilu, Nathan Linial posted to approximation complexity interesting by NeilInCanadia on 2009-06-19 05:03:01 as along with 1 person shivak
	Approximate algorithms for some generalized knapsack problems [My Copy] Theoretical Computer Science, Vol. 3, No. 3. (December 1976), pp. 293-304. by A. Chandra, D. Hirschberg, C. Wong posted to approximation by NeilInCanadia on 2009-05-18 03:32:22 as
	A Partition-Based Relaxation For Steiner Trees [My Copy] (20 Dec 2007) by Jochen Konemann, David Pritchard, Kunlun Tan posted to approximation lp network_design steiner by NeilInCanadia on 2009-05-12 00:02:07 as
	Approximating a finite metric by a small number of tree metrics [My Copy] Foundations of Computer Science, 1998. Proceedings.39th Annual Symposium on In Foundations of Computer Science, 1998. Proceedings.39th Annual Symposium on (1998), pp. 379-388. by M. Charikar, C. Chekuri, A. Goel, S. Guha, S. Plotkin posted to approximation metric_embeddings by NeilInCanadia on 2008-11-29 17:32:14 as along with 1 person Operator
	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms [My Copy] Journal of the ACM, Vol. 46, No. 6. (November 1999), pp. 787-832. by Tom Leighton, Satish Rao posted to approximation network_flow by NeilInCanadia on 2007-11-16 16:18:46 as along with 3 people michael_hliao tmmurali mohits
	A primal-dual approximation algorithm for generalized steiner network problems [My Copy] Combinatorica, Vol. 15, No. 3. (1995), pp. 435-454. by David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani posted to approximation steiner by NeilInCanadia on 2007-11-14 03:37:43 as
	Approximation Algorithms [My Copy] (22 March 2004) by Vijay V. Vazirani posted to approximation books by NeilInCanadia on 2007-11-14 03:37:02 as along with 3 people citeUlike123 rocarvaj ethkim
	Randomized rounding: A technique for provably good algorithms and algorithmic proofs [My Copy] Combinatorica, Vol. 7, No. 4. (23 December 1987), pp. 365-374. by Prabhakar Raghavan, Clark Tompson posted to approximation rounding by NeilInCanadia on 2007-11-13 04:19:51 as
	Packing cycles in undirected graphs [My Copy] Journal of Algorithms In Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 48, No. 1. (August 2003), pp. 239-256. by Alberto Caprara, Alessandro Panconesi, Romeo Rizzi posted to approximation cycle_packing by NeilInCanadia on 2007-10-28 18:49:32 as
	A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem [My Copy] SIAM J. Discret. Math., Vol. 12, No. 3. (September 1999), pp. 289-297. by Vineet Bafna, Piotr Berman, Toshihiro Fujito posted to approximation by NeilInCanadia on 2007-10-25 22:30:16 as along with 1 person yylin
	Approximation algorithms and hardness for domination with propagation [My Copy] (10 Oct 2007) by Ashkan Aazami, Michael D. Stilp posted to approximation by NeilInCanadia on 2007-10-12 23:09:45 as
	New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs [My Copy] Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002,: eský Krumlov, Czech Republic, June 13-15, 2002. Revised Papers (2002), pp. 282-295. by Ton Kloks, C. M. Lee, Jiping Liu posted to approximation by NeilInCanadia on 2007-10-10 22:04:24 as
	The Parking Permit Problem [My Copy] In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (2005), pp. 274-284. by Adam M. Meyerson posted to approximation by NeilInCanadia on 2007-07-26 17:56:22 as
	Hardness of Approximation [My Copy] In Approximation Algorithm for NP-hard problems by Sanjeev Arora, Carsten Lund edited by Dorit Hochbaum posted to approximation by NeilInCanadia on 2007-04-21 03:48:30 as
	Covering rectilinear polygons with axis-parallel rectangles [My Copy] (1999), pp. 445-454. by Anil V. S. Kumar, H. Ramesh posted to approximation by NeilInCanadia on 2007-04-14 22:19:22 as
	On the approximability of some maximum spanning tree problems [My Copy] Theoretical Computer Science, Vol. 181, No. 1. (15 July 1997), pp. 107-118. by Giulia Galbiati, Angelo Morzenti, Francesco Maffioli posted to approximation by NeilInCanadia on 2007-03-19 02:48:31 as
	Inapproximability Results for Guarding Polygons and Terrains [My Copy] Algorithmica, Vol. V31, No. 1. (1 January 2001), pp. 79-113. by S. Eidenbenz, C. Stamm, P. Widmayer posted to approximation by NeilInCanadia on 2006-10-27 23:19:43 as
	Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains [My Copy] Lecture Notes in Computer Science : Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002. Proceedings (2002), 60. by Stephan Eidenbenz posted to approximation by NeilInCanadia on 2006-10-27 23:17:30 as
	Inapproximability of Combinatorial Optimization Problems [My Copy] (24 Sep 2004) by Luca Trevisan posted to approximation by NeilInCanadia on 2006-10-16 02:49:54 as along with 4 people and 2 groups ansobol BarrosH entropy camu Crypto Randomness
	Asymmetric <i>k</i>-center is log<sup></sup> <i>n</i>-hard to approximate [My Copy] J. ACM*, Vol. 52, No. 4. (July 2005), pp. 538-551. by Julia Chuzhoy, Sudipto Guha, Eran Halperin, et al.Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph (. Naor posted to approximation by NeilInCanadia on 2006-10-15 00:57:09 as
	An <italic>O</italic>(log<supscrpt>*</supscrpt><italic>n</italic>) approximation algorithm for the asymmetric <italic>p</italic>-center problem [My Copy] In SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (1996), pp. 1-5. by Sundar Vishwanathan posted to approximation by NeilInCanadia on 2006-10-15 00:55:42 as
	Single-minded unlimited supply pricing on sparse instances [My Copy] In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (2006), pp. 1093-1102. by Patrick Briest, Piotr Krysta posted to approximation by NeilInCanadia on 2006-08-12 22:15:36 as
	On profit-maximizing envy-free pricing [My Copy] In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (2005), pp. 1164-1173. by Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank Mcsherry posted to approximation by NeilInCanadia on 2006-08-07 19:30:27 as
	Approximation Algorithms and Online Mechanisms for Item Pricing [My Copy] In Proceedings of the ACM Conference on Electronic Commerce (2006), pp. 29-35. by M. F. Balcan, A. Blum posted to approximation by NeilInCanadia on 2006-08-07 04:37:06 as
	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming [My Copy] J. ACM, Vol. 42, No. 6. (November 1995), pp. 1115-1145. by Michel X. Goemans, David P. Williamson posted to approximation by NeilInCanadia on 2006-06-13 23:20:03 as along with 2 people BarrosH pcarbo
	Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? [My Copy] Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on (2004), pp. 146-154. by S. Khot, G. Kindler, E. Mossel, R. O'Donnell posted to approximation by NeilInCanadia on 2006-06-13 23:17:19 as
	Near-optimal algorithms for unique games [My Copy] In STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (2006), pp. 205-214. by Moses Charikar, Konstantin Makarychev, Yury Makarychev posted to approximation by NeilInCanadia on 2006-06-13 23:10:24 as

Note: You may cite this page as: http://www.citeulike.org/user/NeilInCanadia/tag/approximation

selfish_routing	38
approximation	28
network_design	26
survey	18
comp_geometry	17
oblivious	17
books	15
graph_theory	15
network_flow	15
vpn	15
random_walks	13
traffic	13
metric_embeddings	11
frog_model	10
networks	10
algorithms	9
complexity	9
hardness	9
load_balancing	9
probability	9
combinatorics	7
routing	7
branching_processes	6
matching	6
matroids	6
optimization	6
partitions	6
buy-at-bulk	5
ip	5
network_coding	5
network_games	5
nonatomic_games	5
notes	5
open_problems	5
probabilistic	5
random_graphs	5
source_location	5
tcp	5
chordal_graphs	4
concentration	4
confluent_flow	4
facility_location	4
graph_packing	4
monotone_paths	4
online_algorithms	4
robustness	4
terrain_guarding	4
agt	3
asymptotics	3
interesting	3
lp	3
planar_graphs	3
steiner	3
congestion_games	2
inequalities	2
matrix_multiplication	2
mcmc	2
metrics	2
percolation	2
rendezvous	2
rent_or_buy	2
scale_free	2
set_cover	2
spanning_trees	2
auctions	1
boolean_functions	1
brw	1
colouring	1
coordination	1
cops	1
cycle_packing	1
discrete_geometry	1
disjoint_paths	1
dynamic_flows	1
economics	1
edp	1
exact	1
expanders	1
functional_programming	1
geometry	1
graph_minors	1
hard-core	1
hypergraphs	1
incorrect	1
large_deviations	1
lie_groups	1
matrices	1
mfmc	1
mixing_time	1
mts	1
numerical_analysis	1
polyhedral	1
quantum_computing	1
reference	1
rounding	1
sle	1
spdes	1
statistical_physics	1
string_theory	1
thesis	1
type_theory	1
voronoi	1

NeilInCanadia's approximation [28 articles] Export

NeilInCanadia's tags