A better approximation ratio and an IP formulation for a sensor cover problem (2012)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-29344-3_5
- Assunto: TEORIA DOS GRAFOS
- Keywords: Approximation Ratio; Cover Problem; Integer Programming Formulation; Strip Packing Problem
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: Latin American Theoretical Informatics Symposium - LATIN
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
BARBOSA, Rafael da Ponte e WAKABAYASHI, Yoshiko. A better approximation ratio and an IP formulation for a sensor cover problem. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_5. Acesso em: 20 jul. 2024. -
APA
Barbosa, R. da P., & Wakabayashi, Y. (2012). A better approximation ratio and an IP formulation for a sensor cover problem. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_5 -
NLM
Barbosa R da P, Wakabayashi Y. A better approximation ratio and an IP formulation for a sensor cover problem [Internet]. Proceedings. 2012 ;[citado 2024 jul. 20 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_5 -
Vancouver
Barbosa R da P, Wakabayashi Y. A better approximation ratio and an IP formulation for a sensor cover problem [Internet]. Proceedings. 2012 ;[citado 2024 jul. 20 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_5 - Sobre grafos hamiltonianos
- Cube packing
- Parametric on-line algorithms for packing rectangles and boxes
- Two- and three-dimensional parametric packing
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Three-dimensional packings with rotations
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- Polynomial-time approximation schemes for circle packing problems
- Path decompositions of regular graphs with prescribed girth
- Partitioning a graph into balanced connected classes: Formulations, separation and experiments
Informações sobre o DOI: 10.1007/978-3-642-29344-3_5 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2281494.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
