Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008 > Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008 |
Ashish Goel; Klaus Jansen; José D. P. Rolim; Ronitt Rubinfeld
Springer Berlin Heidelberg
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
Authors

David R. Karger; Jacob Scott

ARI Id

1674219778210_3367931

Access

Not Available Free

Pages

104-117

DOI

10.1007/978-3-540-85363-3_9

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-85363-3_9

Table of Contents of Book
Showing 1 to 20 of 49 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Approximating Optimal Binary Decision Trees
Micah Adler; Brent Heeringa
1-9
Santa Claus Meets Hypergraph Matchings
Arash Asadpour; Uriel Feige; Amin Saberi
10-20
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Mihai Bădoiu; Erik D. Demaine; MohammadTaghi Hajiaghayi; Anastasios Sidiropoulos; Morteza Zadimoghaddam
21-34
Connected Vertex Covers in Dense Graphs
Jean Cardinal; Eythan Levy
35-48
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
Eden Chlamtac; Gyanit Singh
49-62
Sweeping Points
Adrian Dumitrescu; Minghui Jiang
63-76
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
Venkatesan Guruswami; Prasad Raghavendra
77-90
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
Nir Halman; Chung-Lun Li; David Simchi-Levi
91-103
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
David R. Karger; Jacob Scott
104-117
Approximating Maximum Subgraphs without Short Cycles
Guy Kortsarz; Michael Langberg; Zeev Nutov
118-131
Deterministic 7/8-Approximation for the Metric Maximum TSP
Łukasz Kowalik; Marcin Mucha
132-145
Inapproximability of Survivable Networks
Yuval Lando; Zeev Nutov
146-152
Approximating Single Machine Scheduling with Scenarios
Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson
153-164
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Richard Matthew McCutchen; Samir Khuller
165-178
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
Shashi Mittal; Andreas S. Schulz
179-192
The Directed Minimum Latency Problem
Viswanath Nagarajan; R. Ravi
193-206
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
Thành Nguyen
207-218
Approximating Directed Weighted-Degree Constrained Networks
Zeev Nutov
219-232
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
MohammadAli Safari; Mohammad R. Salavatipour
233-246
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 49 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings