Matches in SemOpenAlex for { <https://semopenalex.org/work/W3023369375> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W3023369375 endingPage "528" @default.
- W3023369375 startingPage "507" @default.
- W3023369375 abstract "In this paper we introduce and study a new problem named emph{min-max edge $q$-coloring} which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer $q$. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most $q$ different colors, and (b) the maximum size of a color group (i.e. set of edges identically colored) is minimized. We show the following results: 1. Min-max edge $q$-coloring is NP-hard, for any $q ge 2$. 2. A polynomial time exact algorithm for min-max edge $q$-coloring on trees. 3. Exact formulas of the optimal solution for cliques and almost tight bounds for bicliques and hypergraphs. 4. A non-trivial lower bound of the optimal solution with respect to the average degree of the graph. 5. An approximation algorithm for planar graphs." @default.
- W3023369375 created "2020-05-13" @default.
- W3023369375 creator A5008143115 @default.
- W3023369375 creator A5053485693 @default.
- W3023369375 date "2015-01-01" @default.
- W3023369375 modified "2023-09-23" @default.
- W3023369375 title "The Min-Max Edge q-Coloring Problem" @default.
- W3023369375 doi "https://doi.org/10.7155/jgaa.00373" @default.
- W3023369375 hasPublicationYear "2015" @default.
- W3023369375 type Work @default.
- W3023369375 sameAs 3023369375 @default.
- W3023369375 citedByCount "2" @default.
- W3023369375 countsByYear W30233693752018 @default.
- W3023369375 countsByYear W30233693752019 @default.
- W3023369375 crossrefType "journal-article" @default.
- W3023369375 hasAuthorship W3023369375A5008143115 @default.
- W3023369375 hasAuthorship W3023369375A5053485693 @default.
- W3023369375 hasBestOaLocation W30233693751 @default.
- W3023369375 hasConcept C114614502 @default.
- W3023369375 hasConcept C123809776 @default.
- W3023369375 hasConcept C132525143 @default.
- W3023369375 hasConcept C149530733 @default.
- W3023369375 hasConcept C154945302 @default.
- W3023369375 hasConcept C162307627 @default.
- W3023369375 hasConcept C203776342 @default.
- W3023369375 hasConcept C33923547 @default.
- W3023369375 hasConcept C41008148 @default.
- W3023369375 hasConceptScore W3023369375C114614502 @default.
- W3023369375 hasConceptScore W3023369375C123809776 @default.
- W3023369375 hasConceptScore W3023369375C132525143 @default.
- W3023369375 hasConceptScore W3023369375C149530733 @default.
- W3023369375 hasConceptScore W3023369375C154945302 @default.
- W3023369375 hasConceptScore W3023369375C162307627 @default.
- W3023369375 hasConceptScore W3023369375C203776342 @default.
- W3023369375 hasConceptScore W3023369375C33923547 @default.
- W3023369375 hasConceptScore W3023369375C41008148 @default.
- W3023369375 hasIssue "1" @default.
- W3023369375 hasLocation W30233693751 @default.
- W3023369375 hasLocation W30233693752 @default.
- W3023369375 hasLocation W30233693753 @default.
- W3023369375 hasOpenAccess W3023369375 @default.
- W3023369375 hasPrimaryLocation W30233693751 @default.
- W3023369375 hasRelatedWork W1978042415 @default.
- W3023369375 hasRelatedWork W2017331178 @default.
- W3023369375 hasRelatedWork W2079261006 @default.
- W3023369375 hasRelatedWork W2132726866 @default.
- W3023369375 hasRelatedWork W2616370246 @default.
- W3023369375 hasRelatedWork W2976797620 @default.
- W3023369375 hasRelatedWork W3086542228 @default.
- W3023369375 hasRelatedWork W3195612562 @default.
- W3023369375 hasRelatedWork W4292446685 @default.
- W3023369375 hasRelatedWork W749633089 @default.
- W3023369375 hasVolume "19" @default.
- W3023369375 isParatext "false" @default.
- W3023369375 isRetracted "false" @default.
- W3023369375 magId "3023369375" @default.
- W3023369375 workType "article" @default.