<--- Back to Details
First PageDocument Content
Computational complexity theory / Graph theory / NP-complete problems / Mathematics / Travelling salesman problem / Set TSP problem / Steiner tree problem / Vertex cover / Approximation algorithm / APX / Cut / Time complexity
Date: 2014-11-26 08:32:22
Computational complexity theory
Graph theory
NP-complete problems
Mathematics
Travelling salesman problem
Set TSP problem
Steiner tree problem
Vertex cover
Approximation algorithm
APX
Cut
Time complexity

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Add to Reading List

Source URL: www.cs.huji.ac.il

Download Document from Source Website

File Size: 1,21 MB

Share Document on Facebook

Similar Documents

APX Power NL Reliable, robust and intuitive trading platform. Provides anonymous trading and a dedicated customer support 7 days a week. Intraday Market

DocID: 1vqys - View Document

Europäische Vereinigung zur Förderung der Experimentellen Archäologie European Association for the Advancement of Archaeology by Experiment 15th international exar-conference, LVR-APX, Xanten (G) 28th September – 1s

DocID: 1vmoZ - View Document

Microsoft Word - APX Power NL Exchange Notice 17 - ECC Essential Maintenancedoc

DocID: 1vfu5 - View Document

Price List – APX Power B.V. Issue Date: 18 December 2014 Effective Date: 1 JanuaryThis appendix is the price list published by APX Power B.V. for the purposes of clause 6.10 of the APX Power Trading Rules. Cha

DocID: 1uYkV - View Document

Flying Stars Table Runner Apx 68” x 20” Learn how to make three dimensional flying geese to make these flying star blocks! Put them together and add a mitered border for a great table-runner just in time for the hol

DocID: 1sFnC - View Document