| Presentation | 1994/9/22 Approximating Discrete Collections via Local Improvements Magnus M. Halldorsson, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider further a local search technique with which we obtaind improved apporoximations for the Set Paking problem.We obtain improved approximation for the Set Cover problem,Graph Coloring problem with a complementary objective function,and the Induced k-Colorable Subgraph ploblem. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | local search / set cover / graph coloring / approximation algorithms |
| Paper # | COMP94-39 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1994/9/22(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Approximating Discrete Collections via Local Improvements |
| Sub Title (in English) | |
| Keyword(1) | local search |
| Keyword(2) | set cover |
| Keyword(3) | graph coloring |
| Keyword(4) | approximation algorithms |
| 1st Author's Name | Magnus M. Halldorsson |
| 1st Author's Affiliation | Japan Advanced Institute of Scinnce and Technology() |
| Date | 1994/9/22 |
| Paper # | COMP94-39 |
| Volume (vol) | vol.94 |
| Number (no) | 258 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |