Approximation, randomization, and combinatorial optimization [electronic resource] : algorithms and techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 : proceedings / Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim (eds.).

Bibliographic Details
Corporate Authors: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems Princeton, N.J.
International Workshop on Randomization and Computation
Other Authors: Goldberg, Leslie Ann (Editor)
Language:English
Published: Heidelberg ; New York : Springer, [2011]
Series:Lecture notes in computer science, 6845
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Subjects:
Genre:
Online Access:
Variant Title:
APPROX 2011
RANDOM 2011
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Format: Electronic Conference Proceeding eBook

MARC

LEADER 00000nam a22000003i 4500
001 ebs930612e
003 EBZ
006 m o d ||||||
007 cr|unu||||||||
008 110707s2011 gw a ob 101 0 eng
020 |z 9783642229343 
020 |a 9783642229350 (online) 
035 |a (EBZ)ebs930612e 
040 |a DLC   |b eng   |d EBZ 
042 |a pcc 
050 0 0 |a QA75.5  |b .I643 2011 
111 2 |a International Workshop on Approximation Algorithms for Combinatorial Optimization Problems  |n (14th :  |d 2011 :  |c Princeton, N.J.),  |j author. 
245 1 0 |a Approximation, randomization, and combinatorial optimization  |h [electronic resource] :  |b algorithms and techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 : proceedings /  |c Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim (eds.). 
246 3 |a APPROX 2011 
246 3 |a RANDOM 2011 
246 2 |a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 
264 1 |a Heidelberg ;  |a New York :  |b Springer,  |c [2011] 
490 0 |a Lecture notes in computer science,  |x 0302-9743 ;  |v 6845 
490 0 |a LNCS sublibrary. SL 1, Theoretical computer science and general issues 
504 |a Includes bibliographical references and index. 
505 2 |a New tools for graph coloring / Sanjeev Arora and Rong Ge -- Inapproximability of NP-complete variants of Nash equilibrium / Per Austrin, Mark Braverman, and Eden Chlamtáč. 
650 0 |a Computer science  |x Statistical methods  |v Congresses. 
650 0 |a Computer algorithms  |v Congresses. 
700 1 |a Goldberg, Leslie Ann,  |e editor. 
711 2 |a International Workshop on Randomization and Computation  |n (15th :  |d 2011 :  |c Princeton University),  |j author. 
773 0 |t Springer English/International eBooks 2011 - Full Set   |d Springer Nature 
776 1 |t Approximation, randomization, and combinatorial optimization  |w (DLC)2011933808 
856 4 0 |y Access Content Online(from Springer English/International eBooks 2011 - Full Set)  |u https://ezproxy.msu.edu/login?url=https://link.springer.com/10.1007/978-3-642-22935-0  |z Springer English/International eBooks 2011 - Full Set: 2011