Approximation and Online Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

22

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540939795, 9783540939801

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Cooperation in Multiorganization Matching

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_7 ◽

2009 ◽

pp. 78-91 ◽

Author(s):

Laurent Gourvès ◽

Jérôme Monnot ◽

Fanny Pascual

Download Full-text

On the Maximum Edge Coloring Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_22 ◽

2009 ◽

pp. 279-292 ◽

Author(s):

Giorgio Lucarelli ◽

Ioannis Milis ◽

Vangelis Th. Paschos

Keyword(s):

Edge Coloring ◽

Coloring Problem

Download Full-text

Caching Content under Digital Rights Management

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_15 ◽

2009 ◽

pp. 188-200 ◽

Author(s):

Leah Epstein ◽

Amos Fiat ◽

Meital Levy

Keyword(s):

Digital Rights Management ◽

Digital Rights ◽

Rights Management

Download Full-text

Stackelberg Strategies and Collusion in Network Games with Splittable Flow

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_11 ◽

2009 ◽

pp. 133-146 ◽

Author(s):

Tobias Harks

Keyword(s):

Network Games ◽

Stackelberg Strategies

Download Full-text

Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_14 ◽

2009 ◽

pp. 174-187 ◽

Author(s):

Chandrashekhar Nagarajan ◽

Yogeshwer Sharma ◽

David P. Williamson

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Design Problems ◽

Network Design Problems ◽

Prize Collecting

Download Full-text

Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_18 ◽

2009 ◽

pp. 227-240 ◽

Author(s):

Andreas Wiese ◽

Evangelos Kranakis

Keyword(s):

Unit Disk ◽

Dominating Set ◽

Connected Dominating Set ◽

Unit Disk Graphs ◽

Download Full-text

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_3 ◽

2009 ◽

pp. 29-42 ◽

Author(s):

Omid Amini ◽

David Peleg ◽

Stéphane Pérennes ◽

Ignasi Sau ◽

Saket Saurabh

Download Full-text

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_1 ◽

2009 ◽

pp. 1-14 ◽

Author(s):

Jochen Könemann ◽

Ojas Parekh ◽

David Pritchard

Keyword(s):

High Capacity ◽

Multicommodity Flow

Download Full-text

Size Versus Stability in the Marriage Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_2 ◽

2009 ◽

pp. 15-28 ◽

Author(s):

Péter Biró ◽

David F. Manlove ◽

Shubham Mittal

Keyword(s):

Marriage Problem

Download Full-text

Experimental Analysis of Scheduling Algorithms for Aggregated Links

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-93980-1_20 ◽

2009 ◽

pp. 253-266

Author(s):

Wojciech Jawor ◽

Marek Chrobak ◽

Mart Molle

Keyword(s):

Experimental Analysis ◽

Scheduling Algorithms

Download Full-text