Skip to main content Accessibility help
×
Home
Hostname: page-component-7ccbd9845f-dzwm5 Total loading time: 0.301 Render date: 2023-01-29T20:44:51.038Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Asymptotic differential approximation ratio:Definitions, motivations and application to some combinatorial problems

Published online by Cambridge University Press:  15 August 2002

Marc Demange
Affiliation:
CERMSEM, Universite Paris I, 106-112 boulevard de l'Hôpital, 75647 Paris Cedex 13, France.
Vangelis Th. Paschos
Affiliation:
LAMSADE, Universite Paris-Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France.
Get access

Abstract

We first motivate and define a notion of asymptotic differential approximation ratio. For this, we introduce a new class of problems called radial problems including in particular the hereditary ones. Next, we validate the definition of the asymptotic differential approximation ratio by proving positive, conditional and negative approximation results for some combinatorial problems. We first derive a differential approximation analysis of a classical greedy algorithm for bin packing, the “first fit decreasing”. Next we deal with minimum vertex-covering-by-cliques of a graph and the minimum edge-covering-by-complete-bipartite-subgraphs of a bipartite graph and devise a differential-approximation preserving reduction from the former to the latter. Finally, we prove two negative differential approximation results about the ability of minimum vertex-coloring to be approximated by a polynomial time approximation schema.

Type
Research Article
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *